./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_BER_test5-1.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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:04:44,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:04:44,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:04:44,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:04:44,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:04:44,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:04:44,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:04:44,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:04:44,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:04:44,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:04:44,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:04:44,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:04:44,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:04:44,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:04:44,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:04:44,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:04:44,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:04:44,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:04:44,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:04:44,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:04:44,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:04:44,445 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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2025-03-17 19:04:44,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:04:44,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:04:44,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:04:44,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:04:44,653 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:04:44,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-03-17 19:04:45,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ae27e47/80196f5bcae440e9a0935d899577d79d/FLAG6a2dafb6d [2025-03-17 19:04:46,035 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:04:46,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-03-17 19:04:46,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ae27e47/80196f5bcae440e9a0935d899577d79d/FLAG6a2dafb6d [2025-03-17 19:04:46,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ae27e47/80196f5bcae440e9a0935d899577d79d [2025-03-17 19:04:46,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:04:46,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:04:46,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:04:46,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:04:46,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:04:46,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeeef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46, skipping insertion in model container [2025-03-17 19:04:46,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:04:46,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:04:46,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:04:46,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:04:46,855 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:04:46,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46 WrapperNode [2025-03-17 19:04:46,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:04:46,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:04:46,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:04:46,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:04:46,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,946 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1984 [2025-03-17 19:04:46,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:04:46,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:04:46,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:04:46,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:04:46,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:46,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,044 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-03-17 19:04:47,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:04:47,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:04:47,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:04:47,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:04:47,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (1/1) ... [2025-03-17 19:04:47,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:04:47,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:04:47,157 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-17 19:04:47,160 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-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 19:04:47,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:04:47,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:04:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 19:04:47,180 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:04:47,180 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:04:47,180 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:04:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:04:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:04:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:04:47,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:04:47,348 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:04:47,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:04:48,681 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 19:04:48,791 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-03-17 19:04:48,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:04:48,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:04:48,851 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 19:04:48,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:04:48 BoogieIcfgContainer [2025-03-17 19:04:48,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:04:48,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:04:48,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:04:48,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:04:48,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:04:46" (1/3) ... [2025-03-17 19:04:48,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a311db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:04:48, skipping insertion in model container [2025-03-17 19:04:48,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:04:46" (2/3) ... [2025-03-17 19:04:48,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a311db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:04:48, skipping insertion in model container [2025-03-17 19:04:48,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:04:48" (3/3) ... [2025-03-17 19:04:48,862 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2025-03-17 19:04:48,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:04:48,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-1.i that has 6 procedures, 585 locations, 1 initial locations, 46 loop locations, and 10 error locations. [2025-03-17 19:04:48,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:04:48,951 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;@61e6f0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:04:48,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 19:04:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 577 states, 550 states have (on average 1.6290909090909091) internal successors, (896), 567 states have internal predecessors, (896), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 19:04:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:04:48,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:48,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:04:48,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash 30801864, now seen corresponding path program 1 times [2025-03-17 19:04:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117074198] [2025-03-17 19:04:48,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:49,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:04:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:04:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:49,104 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-17 19:04:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117074198] [2025-03-17 19:04:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117074198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:04:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746976633] [2025-03-17 19:04:49,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:04:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:04:49,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:04:49,127 INFO L87 Difference]: Start difference. First operand has 577 states, 550 states have (on average 1.6290909090909091) internal successors, (896), 567 states have internal predecessors, (896), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-17 19:04:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:49,388 INFO L93 Difference]: Finished difference Result 1700 states and 2754 transitions. [2025-03-17 19:04:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:04:49,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 19:04:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:49,402 INFO L225 Difference]: With dead ends: 1700 [2025-03-17 19:04:49,402 INFO L226 Difference]: Without dead ends: 1117 [2025-03-17 19:04:49,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 19:04:49,409 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 786 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:49,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1523 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:04:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-17 19:04:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 740. [2025-03-17 19:04:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 714 states have (on average 1.4761904761904763) internal successors, (1054), 731 states have internal predecessors, (1054), 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-17 19:04:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1086 transitions. [2025-03-17 19:04:49,497 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1086 transitions. Word has length 4 [2025-03-17 19:04:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:49,497 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1086 transitions. [2025-03-17 19:04:49,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-17 19:04:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1086 transitions. [2025-03-17 19:04:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:04:49,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:49,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:04:49,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:49,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1820386549, now seen corresponding path program 1 times [2025-03-17 19:04:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019698702] [2025-03-17 19:04:49,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:04:49,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:04:49,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:49,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:50,127 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-17 19:04:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019698702] [2025-03-17 19:04:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019698702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:50,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:50,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:04:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005799389] [2025-03-17 19:04:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:50,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:04:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:50,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:04:50,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:04:50,131 INFO L87 Difference]: Start difference. First operand 740 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-17 19:04:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:50,355 INFO L93 Difference]: Finished difference Result 1432 states and 2100 transitions. [2025-03-17 19:04:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:04:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2025-03-17 19:04:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:50,360 INFO L225 Difference]: With dead ends: 1432 [2025-03-17 19:04:50,360 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 19:04:50,363 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-17 19:04:50,363 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 30 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:50,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1994 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:04:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 19:04:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-17 19:04:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 672 states have (on average 1.4538690476190477) internal successors, (977), 689 states have internal predecessors, (977), 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-17 19:04:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1009 transitions. [2025-03-17 19:04:50,389 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1009 transitions. Word has length 146 [2025-03-17 19:04:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:50,389 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1009 transitions. [2025-03-17 19:04:50,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-17 19:04:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1009 transitions. [2025-03-17 19:04:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:04:50,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:50,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:50,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:04:50,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:50,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -728076484, now seen corresponding path program 1 times [2025-03-17 19:04:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374011020] [2025-03-17 19:04:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:04:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:04:50,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:50,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:50,601 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-17 19:04:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374011020] [2025-03-17 19:04:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374011020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:04:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718597439] [2025-03-17 19:04:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:04:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:04:50,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:04:50,603 INFO L87 Difference]: Start difference. First operand 698 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-17 19:04:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:50,727 INFO L93 Difference]: Finished difference Result 1473 states and 2127 transitions. [2025-03-17 19:04:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:04:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-03-17 19:04:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:50,733 INFO L225 Difference]: With dead ends: 1473 [2025-03-17 19:04:50,736 INFO L226 Difference]: Without dead ends: 781 [2025-03-17 19:04:50,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 19:04:50,738 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 58 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:50,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1369 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:04:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-17 19:04:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2025-03-17 19:04:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 755 states have (on average 1.4450331125827816) internal successors, (1091), 772 states have internal predecessors, (1091), 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-17 19:04:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1123 transitions. [2025-03-17 19:04:50,763 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1123 transitions. Word has length 146 [2025-03-17 19:04:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:50,764 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1123 transitions. [2025-03-17 19:04:50,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-17 19:04:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1123 transitions. [2025-03-17 19:04:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:04:50,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:50,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:50,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:04:50,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:50,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 630311136, now seen corresponding path program 1 times [2025-03-17 19:04:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806591909] [2025-03-17 19:04:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:50,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:04:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:04:50,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:51,112 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-17 19:04:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806591909] [2025-03-17 19:04:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806591909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:04:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368360721] [2025-03-17 19:04:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:04:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:04:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:04:51,116 INFO L87 Difference]: Start difference. First operand 781 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-17 19:04:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:51,264 INFO L93 Difference]: Finished difference Result 1431 states and 2060 transitions. [2025-03-17 19:04:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:04:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 161 [2025-03-17 19:04:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:51,269 INFO L225 Difference]: With dead ends: 1431 [2025-03-17 19:04:51,269 INFO L226 Difference]: Without dead ends: 739 [2025-03-17 19:04:51,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:04:51,271 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 36 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:51,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1768 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:04:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-17 19:04:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-03-17 19:04:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 713 states have (on average 1.4221598877980364) internal successors, (1014), 730 states have internal predecessors, (1014), 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-17 19:04:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1046 transitions. [2025-03-17 19:04:51,293 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1046 transitions. Word has length 161 [2025-03-17 19:04:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:51,294 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1046 transitions. [2025-03-17 19:04:51,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-17 19:04:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1046 transitions. [2025-03-17 19:04:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:04:51,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:51,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:04:51,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:51,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash 742578326, now seen corresponding path program 1 times [2025-03-17 19:04:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041530820] [2025-03-17 19:04:51,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:51,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:04:51,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:04:51,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:51,525 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-17 19:04:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041530820] [2025-03-17 19:04:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041530820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:04:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854051851] [2025-03-17 19:04:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:04:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:51,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:04:51,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:04:51,527 INFO L87 Difference]: Start difference. First operand 739 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-17 19:04:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:51,648 INFO L93 Difference]: Finished difference Result 1383 states and 1966 transitions. [2025-03-17 19:04:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:04:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 161 [2025-03-17 19:04:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:51,651 INFO L225 Difference]: With dead ends: 1383 [2025-03-17 19:04:51,652 INFO L226 Difference]: Without dead ends: 733 [2025-03-17 19:04:51,653 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-17 19:04:51,654 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 9 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:51,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1769 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:04:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-17 19:04:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2025-03-17 19:04:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 707 states have (on average 1.42008486562942) internal successors, (1004), 724 states have internal predecessors, (1004), 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-17 19:04:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1036 transitions. [2025-03-17 19:04:51,669 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1036 transitions. Word has length 161 [2025-03-17 19:04:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:51,669 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1036 transitions. [2025-03-17 19:04:51,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-17 19:04:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1036 transitions. [2025-03-17 19:04:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:04:51,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:51,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:04:51,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:51,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1193642086, now seen corresponding path program 1 times [2025-03-17 19:04:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329521612] [2025-03-17 19:04:51,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:04:51,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:04:51,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:51,869 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-17 19:04:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329521612] [2025-03-17 19:04:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329521612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:04:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293670512] [2025-03-17 19:04:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:04:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:04:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:04:51,871 INFO L87 Difference]: Start difference. First operand 733 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-17 19:04:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:52,029 INFO L93 Difference]: Finished difference Result 1685 states and 2397 transitions. [2025-03-17 19:04:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:04:52,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 161 [2025-03-17 19:04:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:52,034 INFO L225 Difference]: With dead ends: 1685 [2025-03-17 19:04:52,034 INFO L226 Difference]: Without dead ends: 1041 [2025-03-17 19:04:52,035 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-17 19:04:52,036 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 379 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:52,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1385 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:04:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-17 19:04:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1036. [2025-03-17 19:04:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 997 states have (on average 1.4252758274824473) internal successors, (1421), 1024 states have internal predecessors, (1421), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 19:04:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1479 transitions. [2025-03-17 19:04:52,099 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1479 transitions. Word has length 161 [2025-03-17 19:04:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:52,099 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1479 transitions. [2025-03-17 19:04:52,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-17 19:04:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1479 transitions. [2025-03-17 19:04:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 19:04:52,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:52,101 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:04:52,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 861164937, now seen corresponding path program 1 times [2025-03-17 19:04:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667896972] [2025-03-17 19:04:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:52,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 19:04:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 19:04:52,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:52,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:04:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667896972] [2025-03-17 19:04:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667896972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:04:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542757960] [2025-03-17 19:04:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:04:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:04:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:04:52,393 INFO L87 Difference]: Start difference. First operand 1036 states and 1479 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:52,564 INFO L93 Difference]: Finished difference Result 1103 states and 1564 transitions. [2025-03-17 19:04:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:04:52,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 176 [2025-03-17 19:04:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:52,569 INFO L225 Difference]: With dead ends: 1103 [2025-03-17 19:04:52,569 INFO L226 Difference]: Without dead ends: 1101 [2025-03-17 19:04:52,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:04:52,570 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 457 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:52,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1794 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:04:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-17 19:04:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-03-17 19:04:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1057 states have (on average 1.4172185430463575) internal successors, (1498), 1084 states have internal predecessors, (1498), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:04:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1562 transitions. [2025-03-17 19:04:52,632 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1562 transitions. Word has length 176 [2025-03-17 19:04:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:52,633 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1562 transitions. [2025-03-17 19:04:52,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1562 transitions. [2025-03-17 19:04:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 19:04:52,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:52,634 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:52,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:04:52,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1511550907, now seen corresponding path program 1 times [2025-03-17 19:04:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:52,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20324616] [2025-03-17 19:04:52,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:52,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:04:53,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:04:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:53,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:04:53,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20324616] [2025-03-17 19:04:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20324616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:04:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599648107] [2025-03-17 19:04:53,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:04:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:04:53,330 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-17 19:04:53,331 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-17 19:04:53,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:04:53,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:04:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:53,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:04:53,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:04:53,786 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-17 19:04:53,801 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-17 19:04:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:04:54,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:04:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599648107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:04:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-03-17 19:04:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293034202] [2025-03-17 19:04:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:04:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:04:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:04:54,423 INFO L87 Difference]: Start difference. First operand 1099 states and 1562 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:56,230 INFO L93 Difference]: Finished difference Result 2172 states and 3089 transitions. [2025-03-17 19:04:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:04:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-17 19:04:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:56,235 INFO L225 Difference]: With dead ends: 2172 [2025-03-17 19:04:56,235 INFO L226 Difference]: Without dead ends: 1115 [2025-03-17 19:04:56,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 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-17 19:04:56,237 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 737 mSDsluCounter, 3287 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:56,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 3929 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 19:04:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-17 19:04:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1099. [2025-03-17 19:04:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1057 states have (on average 1.4162724692526016) internal successors, (1497), 1084 states have internal predecessors, (1497), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:04:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1561 transitions. [2025-03-17 19:04:56,266 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1561 transitions. Word has length 182 [2025-03-17 19:04:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:56,266 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1561 transitions. [2025-03-17 19:04:56,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1561 transitions. [2025-03-17 19:04:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 19:04:56,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:56,269 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:56,281 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-17 19:04:56,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:04:56,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 189771297, now seen corresponding path program 1 times [2025-03-17 19:04:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378489148] [2025-03-17 19:04:56,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:56,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:56,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:04:56,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:04:56,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:04:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378489148] [2025-03-17 19:04:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378489148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:04:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643316053] [2025-03-17 19:04:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:04:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:04:56,994 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-17 19:04:56,996 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-17 19:04:57,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:04:57,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:04:57,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:57,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:57,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:04:57,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:04:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:04:57,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:04:57,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643316053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:57,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:04:57,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:04:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821913035] [2025-03-17 19:04:57,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:57,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:04:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:57,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:04:57,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:04:57,521 INFO L87 Difference]: Start difference. First operand 1099 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:57,708 INFO L93 Difference]: Finished difference Result 2156 states and 3074 transitions. [2025-03-17 19:04:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:04:57,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-17 19:04:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:57,713 INFO L225 Difference]: With dead ends: 2156 [2025-03-17 19:04:57,714 INFO L226 Difference]: Without dead ends: 1099 [2025-03-17 19:04:57,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:04:57,716 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 17 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:57,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1691 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:04:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-17 19:04:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2025-03-17 19:04:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1057 states have (on average 1.4143803216650899) internal successors, (1495), 1084 states have internal predecessors, (1495), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:04:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1559 transitions. [2025-03-17 19:04:57,749 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1559 transitions. Word has length 183 [2025-03-17 19:04:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1559 transitions. [2025-03-17 19:04:57,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1559 transitions. [2025-03-17 19:04:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 19:04:57,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:57,752 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:57,765 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-17 19:04:57,956 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,SelfDestructingSolverStorable8 [2025-03-17 19:04:57,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1891371880, now seen corresponding path program 1 times [2025-03-17 19:04:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:57,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065934283] [2025-03-17 19:04:57,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:58,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 19:04:58,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 19:04:58,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:58,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:04:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:58,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065934283] [2025-03-17 19:04:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065934283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:58,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:58,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:04:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337207768] [2025-03-17 19:04:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:04:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:58,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:04:58,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:04:58,367 INFO L87 Difference]: Start difference. First operand 1099 states and 1559 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:58,618 INFO L93 Difference]: Finished difference Result 2159 states and 3076 transitions. [2025-03-17 19:04:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:04:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-17 19:04:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:58,624 INFO L225 Difference]: With dead ends: 2159 [2025-03-17 19:04:58,624 INFO L226 Difference]: Without dead ends: 1105 [2025-03-17 19:04:58,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:04:58,626 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 8 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:58,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2230 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:04:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2025-03-17 19:04:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2025-03-17 19:04:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1063 states have (on average 1.4120413922859831) internal successors, (1501), 1090 states have internal predecessors, (1501), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:04:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1565 transitions. [2025-03-17 19:04:58,649 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1565 transitions. Word has length 184 [2025-03-17 19:04:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1565 transitions. [2025-03-17 19:04:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1565 transitions. [2025-03-17 19:04:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:04:58,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:58,652 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:58,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:04:58,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1903194045, now seen corresponding path program 1 times [2025-03-17 19:04:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269678308] [2025-03-17 19:04:58,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:58,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:04:58,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:04:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:04:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269678308] [2025-03-17 19:04:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269678308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:04:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:04:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:04:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522882844] [2025-03-17 19:04:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:04:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:04:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:04:59,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:04:59,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:04:59,000 INFO L87 Difference]: Start difference. First operand 1105 states and 1565 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:04:59,378 INFO L93 Difference]: Finished difference Result 2165 states and 3080 transitions. [2025-03-17 19:04:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:04:59,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:04:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:04:59,385 INFO L225 Difference]: With dead ends: 2165 [2025-03-17 19:04:59,385 INFO L226 Difference]: Without dead ends: 1115 [2025-03-17 19:04:59,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:04:59,388 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 12 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:04:59,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3272 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:04:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-17 19:04:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1113. [2025-03-17 19:04:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1071 states have (on average 1.4108309990662933) internal successors, (1511), 1098 states have internal predecessors, (1511), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 19:04:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1575 transitions. [2025-03-17 19:04:59,417 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1575 transitions. Word has length 185 [2025-03-17 19:04:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:04:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1575 transitions. [2025-03-17 19:04:59,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:04:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1575 transitions. [2025-03-17 19:04:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:04:59,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:04:59,419 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:04:59,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:04:59,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:04:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:04:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1513158397, now seen corresponding path program 1 times [2025-03-17 19:04:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:04:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108227978] [2025-03-17 19:04:59,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:04:59,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:04:59,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:04:59,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:04:59,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:04:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:04:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:04:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108227978] [2025-03-17 19:04:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108227978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:04:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590065842] [2025-03-17 19:04:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:04:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:04:59,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:04:59,946 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-17 19:04:59,947 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-17 19:05:00,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:05:00,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:05:00,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:00,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:00,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:05:00,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:05:00,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:05:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590065842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:05:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 19:05:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805334135] [2025-03-17 19:05:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:00,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:05:00,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:00,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:05:00,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:05:00,468 INFO L87 Difference]: Start difference. First operand 1113 states and 1575 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:00,582 INFO L93 Difference]: Finished difference Result 2130 states and 3035 transitions. [2025-03-17 19:05:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:05:00,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 185 [2025-03-17 19:05:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:00,587 INFO L225 Difference]: With dead ends: 2130 [2025-03-17 19:05:00,587 INFO L226 Difference]: Without dead ends: 1116 [2025-03-17 19:05:00,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:05:00,589 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 0 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:00,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1811 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:05:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-17 19:05:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-03-17 19:05:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1073 states have (on average 1.4109972041006524) internal successors, (1514), 1101 states have internal predecessors, (1514), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1582 transitions. [2025-03-17 19:05:00,615 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1582 transitions. Word has length 185 [2025-03-17 19:05:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1582 transitions. [2025-03-17 19:05:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1582 transitions. [2025-03-17 19:05:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 19:05:00,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:00,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:00,627 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-17 19:05:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:00,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1304305605, now seen corresponding path program 1 times [2025-03-17 19:05:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903319296] [2025-03-17 19:05:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:00,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 19:05:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 19:05:01,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:01,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:05:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903319296] [2025-03-17 19:05:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903319296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:05:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468824599] [2025-03-17 19:05:01,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:01,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:01,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:01,613 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-17 19:05:01,615 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-17 19:05:01,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 19:05:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 19:05:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:05:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:05:02,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:05:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468824599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:02,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:05:02,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-03-17 19:05:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691828891] [2025-03-17 19:05:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:05:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:02,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:05:02,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:05:02,322 INFO L87 Difference]: Start difference. First operand 1116 states and 1582 transitions. Second operand has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:02,657 INFO L93 Difference]: Finished difference Result 2068 states and 2958 transitions. [2025-03-17 19:05:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:05:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-03-17 19:05:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:02,662 INFO L225 Difference]: With dead ends: 2068 [2025-03-17 19:05:02,662 INFO L226 Difference]: Without dead ends: 1138 [2025-03-17 19:05:02,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:05:02,665 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 21 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:02,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3340 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:05:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-17 19:05:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1130. [2025-03-17 19:05:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1087 states have (on average 1.40754369825207) internal successors, (1530), 1115 states have internal predecessors, (1530), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1598 transitions. [2025-03-17 19:05:02,689 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1598 transitions. Word has length 189 [2025-03-17 19:05:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:02,689 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1598 transitions. [2025-03-17 19:05:02,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1598 transitions. [2025-03-17 19:05:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 19:05:02,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:02,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:02,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:05:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:02,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1107172190, now seen corresponding path program 1 times [2025-03-17 19:05:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959793817] [2025-03-17 19:05:02,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 19:05:02,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 19:05:02,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:02,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:05:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959793817] [2025-03-17 19:05:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959793817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:05:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540964337] [2025-03-17 19:05:03,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:05:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:05:03,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:05:03,308 INFO L87 Difference]: Start difference. First operand 1130 states and 1598 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:03,629 INFO L93 Difference]: Finished difference Result 2062 states and 2941 transitions. [2025-03-17 19:05:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:05:03,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2025-03-17 19:05:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:03,633 INFO L225 Difference]: With dead ends: 2062 [2025-03-17 19:05:03,633 INFO L226 Difference]: Without dead ends: 1126 [2025-03-17 19:05:03,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:05:03,634 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 9 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:03,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2727 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:05:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-03-17 19:05:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2025-03-17 19:05:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1081 states have (on average 1.4061054579093433) internal successors, (1520), 1109 states have internal predecessors, (1520), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1588 transitions. [2025-03-17 19:05:03,657 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1588 transitions. Word has length 190 [2025-03-17 19:05:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1588 transitions. [2025-03-17 19:05:03,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1588 transitions. [2025-03-17 19:05:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 19:05:03,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:03,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:05:03,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:03,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -979344894, now seen corresponding path program 1 times [2025-03-17 19:05:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457361899] [2025-03-17 19:05:03,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:03,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 19:05:03,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 19:05:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:05:03,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457361899] [2025-03-17 19:05:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457361899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:03,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:05:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568560055] [2025-03-17 19:05:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:03,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:05:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:05:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:05:03,968 INFO L87 Difference]: Start difference. First operand 1124 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:04,237 INFO L93 Difference]: Finished difference Result 2061 states and 2938 transitions. [2025-03-17 19:05:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:05:04,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2025-03-17 19:05:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:04,241 INFO L225 Difference]: With dead ends: 2061 [2025-03-17 19:05:04,242 INFO L226 Difference]: Without dead ends: 1130 [2025-03-17 19:05:04,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:05:04,243 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 4 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:04,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2745 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:05:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-17 19:05:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-03-17 19:05:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1087 states have (on average 1.4038638454461823) internal successors, (1526), 1115 states have internal predecessors, (1526), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1594 transitions. [2025-03-17 19:05:04,261 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1594 transitions. Word has length 191 [2025-03-17 19:05:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:04,261 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1594 transitions. [2025-03-17 19:05:04,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1594 transitions. [2025-03-17 19:05:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 19:05:04,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:04,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:04,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:05:04,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1422601597, now seen corresponding path program 1 times [2025-03-17 19:05:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778488304] [2025-03-17 19:05:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:04,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:05:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:05:04,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:05:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778488304] [2025-03-17 19:05:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778488304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:05:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936057704] [2025-03-17 19:05:05,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:05,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:05,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:05:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:05:05,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:05:05,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:05:05,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:05,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:05,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:05:05,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:05:05,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:05:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936057704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:05:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-17 19:05:05,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201131214] [2025-03-17 19:05:05,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:05,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:05:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:05,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:05:05,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:05:05,956 INFO L87 Difference]: Start difference. First operand 1130 states and 1594 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:06,311 INFO L93 Difference]: Finished difference Result 2067 states and 2942 transitions. [2025-03-17 19:05:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:05:06,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2025-03-17 19:05:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:06,315 INFO L225 Difference]: With dead ends: 2067 [2025-03-17 19:05:06,316 INFO L226 Difference]: Without dead ends: 1140 [2025-03-17 19:05:06,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:05:06,318 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:06,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3270 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:05:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-17 19:05:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1138. [2025-03-17 19:05:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1095 states have (on average 1.4027397260273973) internal successors, (1536), 1123 states have internal predecessors, (1536), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1604 transitions. [2025-03-17 19:05:06,336 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1604 transitions. Word has length 192 [2025-03-17 19:05:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1604 transitions. [2025-03-17 19:05:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1604 transitions. [2025-03-17 19:05:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 19:05:06,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:06,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:06,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:05:06,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 19:05:06,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:06,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1819019112, now seen corresponding path program 1 times [2025-03-17 19:05:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:06,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571276208] [2025-03-17 19:05:06,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:06,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:06,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:05:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:05:06,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:06,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:05:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571276208] [2025-03-17 19:05:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571276208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:05:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:05:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:05:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636264828] [2025-03-17 19:05:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:05:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:05:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:05:06,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:05:06,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:05:06,809 INFO L87 Difference]: Start difference. First operand 1138 states and 1604 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:05:07,152 INFO L93 Difference]: Finished difference Result 2079 states and 2957 transitions. [2025-03-17 19:05:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:05:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2025-03-17 19:05:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:05:07,157 INFO L225 Difference]: With dead ends: 2079 [2025-03-17 19:05:07,157 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 19:05:07,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:05:07,159 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 8 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3276 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:05:07,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3276 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:05:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 19:05:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1138. [2025-03-17 19:05:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1095 states have (on average 1.4027397260273973) internal successors, (1536), 1123 states have internal predecessors, (1536), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-17 19:05:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1604 transitions. [2025-03-17 19:05:07,178 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1604 transitions. Word has length 192 [2025-03-17 19:05:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:05:07,178 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1604 transitions. [2025-03-17 19:05:07,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:05:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1604 transitions. [2025-03-17 19:05:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 19:05:07,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:05:07,180 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:07,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:05:07,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 19:05:07,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:05:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1905802926, now seen corresponding path program 1 times [2025-03-17 19:05:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:05:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467718342] [2025-03-17 19:05:07,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:05:07,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:05:07,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:05:07,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:07,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:05:07,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:05:07,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467718342] [2025-03-17 19:05:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467718342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:05:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911937081] [2025-03-17 19:05:07,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:05:07,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:05:07,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:05:07,715 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:05:07,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:05:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:05:08,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:05:08,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:05:08,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:05:08,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-17 19:05:08,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:05:08,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 19:05:08,651 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-17 19:05:08,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-17 19:05:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:05:08,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 19:05:08,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:05:08,818 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 19:05:08,857 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 19:05:08,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 19:05:08,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 19:05:09,486 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 19:05:09,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 45 [2025-03-17 19:05:09,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:05:09,502 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-17 19:05:09,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 19:05:09,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:05:09,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:05:09,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-03-17 19:05:09,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11