./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:55:06,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:55:06,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:55:06,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:55:06,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:55:06,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:55:06,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:55:06,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:55:06,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:55:06,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:55:06,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:55:06,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:55:06,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:55:06,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:55:06,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:55:06,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:55:06,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:55:06,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:55:06,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:55:06,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:55:06,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:55:06,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:55:06,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:55:06,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:55:06,893 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 -> 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 [2025-03-04 14:55:07,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:55:07,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:55:07,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:55:07,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:55:07,129 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:55:07,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2025-03-04 14:55:08,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f2c5518/93935b987d7a492ebc3bd74d455639fc/FLAG0ccd69c14 [2025-03-04 14:55:08,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:55:08,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2025-03-04 14:55:08,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f2c5518/93935b987d7a492ebc3bd74d455639fc/FLAG0ccd69c14 [2025-03-04 14:55:08,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f2c5518/93935b987d7a492ebc3bd74d455639fc [2025-03-04 14:55:08,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:55:08,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:55:08,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:55:08,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:55:08,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:55:08,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:08" (1/1) ... [2025-03-04 14:55:08,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@811b0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:08, skipping insertion in model container [2025-03-04 14:55:08,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:55:08" (1/1) ... [2025-03-04 14:55:08,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:55:08,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:55:08,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:55:09,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:55:09,126 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:55:09,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09 WrapperNode [2025-03-04 14:55:09,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:55:09,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:55:09,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:55:09,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:55:09,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,234 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1984 [2025-03-04 14:55:09,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:55:09,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:55:09,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:55:09,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:55:09,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,336 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 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, 82, 1]. [2025-03-04 14:55:09,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:55:09,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:55:09,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:55:09,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:55:09,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (1/1) ... [2025-03-04 14:55:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:55:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:09,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:55:09,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:55:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:55:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:55:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:55:09,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:55:09,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:55:09,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:55:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:55:09,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:55:09,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:55:09,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:55:09,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:55:11,093 INFO L1325 $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-04 14:55:11,183 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-03-04 14:55:11,183 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:55:11,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:55:11,242 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 14:55:11,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:55:11 BoogieIcfgContainer [2025-03-04 14:55:11,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:55:11,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:55:11,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:55:11,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:55:11,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:55:08" (1/3) ... [2025-03-04 14:55:11,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7e364b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:55:11, skipping insertion in model container [2025-03-04 14:55:11,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:55:09" (2/3) ... [2025-03-04 14:55:11,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7e364b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:55:11, skipping insertion in model container [2025-03-04 14:55:11,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:55:11" (3/3) ... [2025-03-04 14:55:11,250 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-1.i [2025-03-04 14:55:11,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:55:11,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test5-1.i that has 6 procedures, 587 locations, 1 initial locations, 46 loop locations, and 10 error locations. [2025-03-04 14:55:11,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:55:11,335 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;@229badd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:55:11,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 14:55:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 579 states, 552 states have (on average 1.6268115942028984) internal successors, (898), 569 states have internal predecessors, (898), 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-04 14:55:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:55:11,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:11,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:55:11,345 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-04 14:55:11,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash 976518152, now seen corresponding path program 1 times [2025-03-04 14:55:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643504836] [2025-03-04 14:55:11,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:55:11,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:55:11,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:11,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:55:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643504836] [2025-03-04 14:55:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643504836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:11,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:55:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998784600] [2025-03-04 14:55:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:55:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:11,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:55:11,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:55:11,472 INFO L87 Difference]: Start difference. First operand has 579 states, 552 states have (on average 1.6268115942028984) internal successors, (898), 569 states have internal predecessors, (898), 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 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:11,613 INFO L93 Difference]: Finished difference Result 1152 states and 1850 transitions. [2025-03-04 14:55:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:55:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-04 14:55:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:11,623 INFO L225 Difference]: With dead ends: 1152 [2025-03-04 14:55:11,623 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 14:55:11,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:55:11,633 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:11,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 772 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:55:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 14:55:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-04 14:55:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 548 states have (on average 1.4708029197080292) internal successors, (806), 560 states have internal predecessors, (806), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 14:55:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 828 transitions. [2025-03-04 14:55:11,685 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 828 transitions. Word has length 5 [2025-03-04 14:55:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 828 transitions. [2025-03-04 14:55:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 828 transitions. [2025-03-04 14:55:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 14:55:11,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:11,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 14:55:11,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:55:11,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 207291934, now seen corresponding path program 1 times [2025-03-04 14:55:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615512891] [2025-03-04 14:55:11,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:11,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 14:55:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 14:55:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:55:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615512891] [2025-03-04 14:55:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615512891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:55:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382209103] [2025-03-04 14:55:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:11,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:55:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:55:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:11,756 INFO L87 Difference]: Start difference. First operand 569 states and 828 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:11,984 INFO L93 Difference]: Finished difference Result 1299 states and 1905 transitions. [2025-03-04 14:55:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:55:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-04 14:55:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:11,989 INFO L225 Difference]: With dead ends: 1299 [2025-03-04 14:55:11,989 INFO L226 Difference]: Without dead ends: 1120 [2025-03-04 14:55:11,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:11,990 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 786 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:11,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1587 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:55:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-03-04 14:55:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 743. [2025-03-04 14:55:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4741980474198046) internal successors, (1057), 734 states have internal predecessors, (1057), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:55:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1089 transitions. [2025-03-04 14:55:12,054 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1089 transitions. Word has length 6 [2025-03-04 14:55:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1089 transitions. [2025-03-04 14:55:12,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1089 transitions. [2025-03-04 14:55:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:55:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:12,059 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, 1] [2025-03-04 14:55:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:55:12,060 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-04 14:55:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 781132950, now seen corresponding path program 1 times [2025-03-04 14:55:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256067898] [2025-03-04 14:55:12,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:55:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:55:12,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:12,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:55:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256067898] [2025-03-04 14:55:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256067898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:12,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:55:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116719988] [2025-03-04 14:55:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:55:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:55:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:55:12,627 INFO L87 Difference]: Start difference. First operand 743 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:12,821 INFO L93 Difference]: Finished difference Result 1482 states and 2174 transitions. [2025-03-04 14:55:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:55:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 147 [2025-03-04 14:55:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:12,828 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 14:55:12,828 INFO L226 Difference]: Without dead ends: 746 [2025-03-04 14:55:12,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:55:12,830 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 105 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2130 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:55:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-04 14:55:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 743. [2025-03-04 14:55:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4644351464435146) internal successors, (1050), 734 states have internal predecessors, (1050), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:55:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1082 transitions. [2025-03-04 14:55:12,852 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1082 transitions. Word has length 147 [2025-03-04 14:55:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:12,853 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1082 transitions. [2025-03-04 14:55:12,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1082 transitions. [2025-03-04 14:55:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:55:12,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:12,858 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, 1] [2025-03-04 14:55:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:55:12,858 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-04 14:55:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1767330083, now seen corresponding path program 1 times [2025-03-04 14:55:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807989103] [2025-03-04 14:55:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:12,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:55:12,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:55:12,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:55:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807989103] [2025-03-04 14:55:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807989103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:55:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160871749] [2025-03-04 14:55:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:55:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:55:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:13,111 INFO L87 Difference]: Start difference. First operand 743 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:13,240 INFO L93 Difference]: Finished difference Result 1485 states and 2166 transitions. [2025-03-04 14:55:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:55:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 14:55:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:13,244 INFO L225 Difference]: With dead ends: 1485 [2025-03-04 14:55:13,245 INFO L226 Difference]: Without dead ends: 749 [2025-03-04 14:55:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:13,249 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:13,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1482 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:55:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-04 14:55:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-04 14:55:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 723 states have (on average 1.4605809128630705) internal successors, (1056), 740 states have internal predecessors, (1056), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:55:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1088 transitions. [2025-03-04 14:55:13,272 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1088 transitions. Word has length 147 [2025-03-04 14:55:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:13,272 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1088 transitions. [2025-03-04 14:55:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1088 transitions. [2025-03-04 14:55:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:55:13,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:13,274 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, 1] [2025-03-04 14:55:13,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:55:13,274 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-04 14:55:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1126243940, now seen corresponding path program 1 times [2025-03-04 14:55:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759590506] [2025-03-04 14:55:13,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:13,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:13,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:55:13,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:55:13,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:13,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:55:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759590506] [2025-03-04 14:55:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759590506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:13,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:55:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774487006] [2025-03-04 14:55:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:55:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:13,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:55:13,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:13,480 INFO L87 Difference]: Start difference. First operand 749 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:13,620 INFO L93 Difference]: Finished difference Result 1622 states and 2360 transitions. [2025-03-04 14:55:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:55:13,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 14:55:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:13,624 INFO L225 Difference]: With dead ends: 1622 [2025-03-04 14:55:13,625 INFO L226 Difference]: Without dead ends: 880 [2025-03-04 14:55:13,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:13,626 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 134 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:13,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1507 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:55:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-04 14:55:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-04 14:55:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 854 states have (on average 1.459016393442623) internal successors, (1246), 871 states have internal predecessors, (1246), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:55:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1278 transitions. [2025-03-04 14:55:13,645 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1278 transitions. Word has length 147 [2025-03-04 14:55:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:13,645 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1278 transitions. [2025-03-04 14:55:13,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:55:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1278 transitions. [2025-03-04 14:55:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:55:13,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:13,647 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, 1] [2025-03-04 14:55:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:55:13,648 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-04 14:55:13,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1048004991, now seen corresponding path program 1 times [2025-03-04 14:55:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115949831] [2025-03-04 14:55:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:55:13,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:55:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:13,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:55:13,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:13,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115949831] [2025-03-04 14:55:13,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115949831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:13,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:13,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:55:13,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207704576] [2025-03-04 14:55:13,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:13,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:55:13,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:13,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:55:13,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:55:13,994 INFO L87 Difference]: Start difference. First operand 880 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:55:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:14,178 INFO L93 Difference]: Finished difference Result 1580 states and 2293 transitions. [2025-03-04 14:55:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:55:14,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 162 [2025-03-04 14:55:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:14,182 INFO L225 Difference]: With dead ends: 1580 [2025-03-04 14:55:14,182 INFO L226 Difference]: Without dead ends: 838 [2025-03-04 14:55:14,183 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-04 14:55:14,184 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 30 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1979 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-04 14:55:14,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1979 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:55:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-04 14:55:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-04 14:55:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 812 states have (on average 1.4396551724137931) internal successors, (1169), 829 states have internal predecessors, (1169), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:55:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1201 transitions. [2025-03-04 14:55:14,201 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1201 transitions. Word has length 162 [2025-03-04 14:55:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:14,201 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1201 transitions. [2025-03-04 14:55:14,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:55:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1201 transitions. [2025-03-04 14:55:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:55:14,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:14,203 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, 1] [2025-03-04 14:55:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:55:14,203 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-04 14:55:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -259268613, now seen corresponding path program 1 times [2025-03-04 14:55:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135577778] [2025-03-04 14:55:14,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:14,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:55:14,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:55:14,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:55:14,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:14,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135577778] [2025-03-04 14:55:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135577778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:14,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:55:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781138400] [2025-03-04 14:55:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:55:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:14,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:55:14,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:14,415 INFO L87 Difference]: Start difference. First operand 838 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:55:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:14,613 INFO L93 Difference]: Finished difference Result 1854 states and 2662 transitions. [2025-03-04 14:55:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:55:14,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 14:55:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:14,619 INFO L225 Difference]: With dead ends: 1854 [2025-03-04 14:55:14,619 INFO L226 Difference]: Without dead ends: 1154 [2025-03-04 14:55:14,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:55:14,621 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 460 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:14,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1529 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:55:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-03-04 14:55:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1149. [2025-03-04 14:55:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1110 states have (on average 1.4396396396396396) internal successors, (1598), 1137 states have internal predecessors, (1598), 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-04 14:55:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1656 transitions. [2025-03-04 14:55:14,648 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1656 transitions. Word has length 162 [2025-03-04 14:55:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:14,648 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1656 transitions. [2025-03-04 14:55:14,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:55:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1656 transitions. [2025-03-04 14:55:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 14:55:14,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:14,650 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, 1] [2025-03-04 14:55:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:55:14,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1749667785, now seen corresponding path program 1 times [2025-03-04 14:55:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018374631] [2025-03-04 14:55:14,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 14:55:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 14:55:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:14,950 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-04 14:55:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:14,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018374631] [2025-03-04 14:55:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018374631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:14,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:14,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:55:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099185711] [2025-03-04 14:55:14,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:14,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:55:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:14,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:55:14,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:55:14,952 INFO L87 Difference]: Start difference. First operand 1149 states and 1656 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 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-04 14:55:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:15,123 INFO L93 Difference]: Finished difference Result 1216 states and 1741 transitions. [2025-03-04 14:55:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:55:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 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 177 [2025-03-04 14:55:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:15,128 INFO L225 Difference]: With dead ends: 1216 [2025-03-04 14:55:15,128 INFO L226 Difference]: Without dead ends: 1214 [2025-03-04 14:55:15,129 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-04 14:55:15,129 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 538 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:15,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2085 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:55:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-04 14:55:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1212. [2025-03-04 14:55:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1170 states have (on average 1.4316239316239316) internal successors, (1675), 1197 states have internal predecessors, (1675), 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-04 14:55:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1739 transitions. [2025-03-04 14:55:15,155 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1739 transitions. Word has length 177 [2025-03-04 14:55:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:15,155 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1739 transitions. [2025-03-04 14:55:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 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-04 14:55:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1739 transitions. [2025-03-04 14:55:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 14:55:15,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:15,157 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-04 14:55:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:55:15,157 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-04 14:55:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 920429147, now seen corresponding path program 1 times [2025-03-04 14:55:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474179539] [2025-03-04 14:55:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:15,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:55:15,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:55:15,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:15,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:16,029 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-04 14:55:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474179539] [2025-03-04 14:55:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474179539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676631393] [2025-03-04 14:55:16,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:16,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:16,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:16,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:16,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:55:16,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:55:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:55:16,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:16,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:16,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 14:55:16,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:16,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-04 14:55:16,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 14:55:16,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 14:55:16,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-04 14:55:17,113 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-04 14:55:17,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676631393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:17,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 14:55:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940438893] [2025-03-04 14:55:17,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:55:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:17,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:55:17,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:55:17,116 INFO L87 Difference]: Start difference. First operand 1212 states and 1739 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 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-04 14:55:19,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 14:55:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:21,485 INFO L93 Difference]: Finished difference Result 2371 states and 3396 transitions. [2025-03-04 14:55:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:55:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 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-04 14:55:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:21,492 INFO L225 Difference]: With dead ends: 2371 [2025-03-04 14:55:21,492 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 14:55:21,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:55:21,495 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 955 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:21,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 5110 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 14:55:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 14:55:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1243. [2025-03-04 14:55:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1201 states have (on average 1.424646128226478) internal successors, (1711), 1228 states have internal predecessors, (1711), 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-04 14:55:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1775 transitions. [2025-03-04 14:55:21,529 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1775 transitions. Word has length 183 [2025-03-04 14:55:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1775 transitions. [2025-03-04 14:55:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 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-04 14:55:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1775 transitions. [2025-03-04 14:55:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:55:21,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:21,531 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-04 14:55:21,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:21,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:21,735 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-04 14:55:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1291215358, now seen corresponding path program 1 times [2025-03-04 14:55:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437179172] [2025-03-04 14:55:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:21,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:55:22,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:55:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:22,382 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-04 14:55:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:22,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437179172] [2025-03-04 14:55:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437179172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:22,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681975180] [2025-03-04 14:55:22,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:22,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:22,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:22,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:22,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:55:22,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:55:22,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:55:22,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:22,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:22,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 14:55:22,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:22,928 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-04 14:55:22,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681975180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 14:55:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991067443] [2025-03-04 14:55:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:55:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:22,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:55:22,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:55:22,933 INFO L87 Difference]: Start difference. First operand 1243 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 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-04 14:55:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:23,188 INFO L93 Difference]: Finished difference Result 2413 states and 3453 transitions. [2025-03-04 14:55:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:55:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 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-04 14:55:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:23,195 INFO L225 Difference]: With dead ends: 2413 [2025-03-04 14:55:23,196 INFO L226 Difference]: Without dead ends: 1292 [2025-03-04 14:55:23,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 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-04 14:55:23,198 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 17 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:23,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1862 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:55:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-04 14:55:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1276. [2025-03-04 14:55:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1234 states have (on average 1.4181523500810373) internal successors, (1750), 1261 states have internal predecessors, (1750), 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-04 14:55:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1814 transitions. [2025-03-04 14:55:23,227 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1814 transitions. Word has length 184 [2025-03-04 14:55:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1814 transitions. [2025-03-04 14:55:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 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-04 14:55:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1814 transitions. [2025-03-04 14:55:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 14:55:23,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:23,228 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-04 14:55:23,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:23,433 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,SelfDestructingSolverStorable9 [2025-03-04 14:55:23,434 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-04 14:55:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -893399208, now seen corresponding path program 1 times [2025-03-04 14:55:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080298001] [2025-03-04 14:55:23,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:23,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 14:55:23,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 14:55:23,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:23,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:23,817 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-04 14:55:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080298001] [2025-03-04 14:55:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080298001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:55:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987804182] [2025-03-04 14:55:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:23,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:55:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:23,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:55:23,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:55:23,819 INFO L87 Difference]: Start difference. First operand 1276 states and 1814 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-04 14:55:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:24,300 INFO L93 Difference]: Finished difference Result 2438 states and 3478 transitions. [2025-03-04 14:55:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:55:24,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-04 14:55:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:24,306 INFO L225 Difference]: With dead ends: 2438 [2025-03-04 14:55:24,307 INFO L226 Difference]: Without dead ends: 1288 [2025-03-04 14:55:24,308 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-04 14:55:24,309 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:24,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2903 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:55:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-04 14:55:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1284. [2025-03-04 14:55:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1242 states have (on average 1.4170692431561998) internal successors, (1760), 1269 states have internal predecessors, (1760), 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-04 14:55:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1824 transitions. [2025-03-04 14:55:24,339 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1824 transitions. Word has length 185 [2025-03-04 14:55:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1824 transitions. [2025-03-04 14:55:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-04 14:55:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1824 transitions. [2025-03-04 14:55:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:55:24,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:24,342 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, 1] [2025-03-04 14:55:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:55:24,342 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-04 14:55:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1855472770, now seen corresponding path program 1 times [2025-03-04 14:55:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718591123] [2025-03-04 14:55:24,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:24,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:55:24,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:55:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:24,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:24,772 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-04 14:55:24,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:24,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718591123] [2025-03-04 14:55:24,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718591123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:24,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:55:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9801100] [2025-03-04 14:55:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:24,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:55:24,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:24,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:55:24,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:55:24,774 INFO L87 Difference]: Start difference. First operand 1284 states and 1824 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-04 14:55:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:25,336 INFO L93 Difference]: Finished difference Result 2453 states and 3498 transitions. [2025-03-04 14:55:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:55:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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 186 [2025-03-04 14:55:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:25,342 INFO L225 Difference]: With dead ends: 2453 [2025-03-04 14:55:25,342 INFO L226 Difference]: Without dead ends: 1306 [2025-03-04 14:55:25,344 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-04 14:55:25,344 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 12 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:25,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3455 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:55:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-03-04 14:55:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2025-03-04 14:55:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1258 states have (on average 1.4165341812400636) internal successors, (1782), 1285 states have internal predecessors, (1782), 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-04 14:55:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1846 transitions. [2025-03-04 14:55:25,372 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1846 transitions. Word has length 186 [2025-03-04 14:55:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1846 transitions. [2025-03-04 14:55:25,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-04 14:55:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1846 transitions. [2025-03-04 14:55:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:55:25,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:25,375 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, 1] [2025-03-04 14:55:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:55:25,375 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-04 14:55:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -559608483, now seen corresponding path program 1 times [2025-03-04 14:55:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:25,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638896111] [2025-03-04 14:55:25,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:25,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:55:25,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:55:25,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:25,907 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-04 14:55:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638896111] [2025-03-04 14:55:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638896111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494022589] [2025-03-04 14:55:25,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:25,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:25,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:25,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:25,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:55:26,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:55:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:55:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:26,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 14:55:26,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:26,544 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-04 14:55:26,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494022589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 14:55:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456026992] [2025-03-04 14:55:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:55:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:26,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:55:26,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:55:26,546 INFO L87 Difference]: Start difference. First operand 1300 states and 1846 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-04 14:55:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:26,669 INFO L93 Difference]: Finished difference Result 2418 states and 3453 transitions. [2025-03-04 14:55:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:55:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 186 [2025-03-04 14:55:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:26,676 INFO L225 Difference]: With dead ends: 2418 [2025-03-04 14:55:26,676 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 14:55:26,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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-04 14:55:26,678 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:26,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2033 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:55:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 14:55:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-03-04 14:55:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1260 states have (on average 1.4166666666666667) internal successors, (1785), 1288 states have internal predecessors, (1785), 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-04 14:55:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1853 transitions. [2025-03-04 14:55:26,703 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1853 transitions. Word has length 186 [2025-03-04 14:55:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1853 transitions. [2025-03-04 14:55:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-04 14:55:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1853 transitions. [2025-03-04 14:55:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 14:55:26,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:26,707 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-04 14:55:26,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:55:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:26,907 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-04 14:55:26,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -286597467, now seen corresponding path program 1 times [2025-03-04 14:55:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385557298] [2025-03-04 14:55:26,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 14:55:27,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 14:55:27,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:27,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:27,361 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-04 14:55:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:27,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385557298] [2025-03-04 14:55:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385557298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119907696] [2025-03-04 14:55:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:27,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:55:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 14:55:27,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 14:55:27,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:27,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:27,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-03-04 14:55:27,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:28,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 14:55:28,035 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 11 treesize of output 7 [2025-03-04 14:55:28,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-03-04 14:55:28,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-04 14:55:28,376 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 11 treesize of output 7 [2025-03-04 14:55:28,393 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 14:55:28,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-04 14:55:28,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-04 14:55:28,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 11 [2025-03-04 14:55:28,484 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 18 treesize of output 10 [2025-03-04 14:55:28,491 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-04 14:55:28,495 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-04 14:55:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:55:28,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:55:30,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_z_8 Int)) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (< 0 (mod (+ (* v_z_10 16777216) (* 256 v_z_8) 17973517 (mod (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~_ha_head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))) is different from false [2025-03-04 14:55:30,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13))) (let ((.cse0 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) (.cse7 (select |c_#memory_int#1| .cse1)) (.cse8 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24)) (.cse9 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12)) (.cse5 (* .cse0 12))) (and (or (< 2147483647 .cse0) (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse3 (+ .cse4 .cse5 4))) (or (< v_z_10 0) (< 0 (mod (+ (* v_z_10 16777216) (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse3 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) (+ .cse4 .cse5)) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 256) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse1 (store .cse7 .cse3 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8 (select v_ArrVal_3595 .cse8)) .cse9 (select v_ArrVal_3595 .cse9)))) (< 255 v_z_9))))) (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse10 (+ .cse4 .cse5 (- 51539607548)))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse2 .cse10 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) (+ .cse4 (- 51539607552) .cse5)) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (not (= (store (store (select (store |c_#memory_int#1| .cse1 (store .cse7 .cse10 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8 (select v_ArrVal_3595 .cse8)) .cse9 (select v_ArrVal_3595 .cse9)) v_ArrVal_3595)) (< 255 v_z_9)))) (< .cse0 2147483648))))))) is different from false [2025-03-04 14:55:30,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse13))) (let ((.cse9 (mod |c_ULTIMATE.start_main_#t~bitwise78#1| 4294967296)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse11) .cse12))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse11) .cse12)) (.cse7 (* .cse9 12))) (and (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse2 (+ .cse6 .cse7 4))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse2 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3)) .cse4 (select v_ArrVal_3595 .cse4)))) (< 0 (mod (+ (* v_z_10 16777216) (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 .cse2 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) (+ .cse6 .cse7)) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) 256) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (< 255 v_z_9)))) (< 2147483647 .cse9)) (or (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse10 (+ .cse6 .cse7 (- 51539607548)))) (or (< v_z_10 0) (not (= v_ArrVal_3595 (store (store (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse10 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3)) .cse4 (select v_ArrVal_3595 .cse4)))) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse5 .cse10 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) (+ .cse6 (- 51539607552) .cse7)) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (< 255 v_z_9)))) (< .cse9 2147483648))))))) is different from false [2025-03-04 14:55:30,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_z_10 Int) (v_ArrVal_3603 (Array Int Int)) (v_z_9 Int) (v_z_8 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse7))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)) (.cse1 (+ .cse2 4))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 0 (mod (+ (mod (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse0) .cse2) v_ArrVal_3602) .cse0 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_8) (not (= v_ArrVal_3595 (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3))) .cse4 (select v_ArrVal_3595 .cse4))))) (< 255 v_z_9))))))) is different from false [2025-03-04 14:55:30,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12) 12))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 v_ArrVal_3592))) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3590))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse8 (select (select .cse11 .cse9) .cse10))) (let ((.cse2 (store |c_#memory_int#1| .cse0 v_ArrVal_3593)) (.cse4 (+ .cse8 4)) (.cse3 (select (select .cse7 .cse9) .cse10))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= v_ArrVal_3590 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse1 (select v_ArrVal_3590 .cse1)))) (not (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5 (select v_ArrVal_3595 .cse5))) .cse6 (select v_ArrVal_3595 .cse6))) v_ArrVal_3595)) (< 255 v_z_8) (< 0 (mod (+ (mod (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse3) .cse8) v_ArrVal_3602) .cse3 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))))))))) is different from false [2025-03-04 14:55:31,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int)) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse12)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse12) 12))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse7 (store (select |c_#memory_$Pointer$#1.offset| .cse7) .cse8 v_ArrVal_3592))) (.cse1 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3590))) (let ((.cse9 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse12)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse12))) (let ((.cse4 (select (select .cse11 .cse9) .cse10))) (let ((.cse0 (store |c_#memory_int#1| .cse7 v_ArrVal_3593)) (.cse2 (select (select .cse1 .cse9) .cse10)) (.cse3 (+ .cse4 4))) (or (< v_z_10 0) (< 0 (mod (+ (* v_z_10 16777216) (* 256 v_z_8) 17973517 (mod (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse2) .cse4) v_ArrVal_3602) .cse2 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* 65536 v_z_9)) 4294967296)) (not (= v_ArrVal_3595 (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse0 .cse2 (store (select .cse0 .cse2) .cse3 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5 (select v_ArrVal_3595 .cse5))) .cse6 (select v_ArrVal_3595 .cse6))))) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (< 255 v_z_8) (not (= (store (select |c_#memory_$Pointer$#1.base| .cse7) .cse8 (select v_ArrVal_3590 .cse8)) v_ArrVal_3590)) (< 255 v_z_9))))))))) is different from false [2025-03-04 14:55:31,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int)) (v_ArrVal_3600 Int) (v_ArrVal_3596 Int) (v_z_10 Int) (v_z_9 Int) (v_ArrVal_3592 Int) (v_ArrVal_3590 (Array Int Int)) (v_z_8 Int) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3594 (Array Int Int)) (v_ArrVal_3595 (Array Int Int)) (v_ArrVal_3610 (Array Int Int)) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_3610)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem63#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem63#1.base|) |c_ULTIMATE.start_main_#t~mem63#1.offset| 0))) (.cse13 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13)) (.cse7 (+ (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13) 12))) (let ((.cse12 (store .cse14 .cse6 (store (select .cse14 .cse6) .cse7 v_ArrVal_3592))) (.cse8 (store .cse5 .cse6 v_ArrVal_3590))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13)) (.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse13))) (let ((.cse9 (select (select .cse12 .cse10) .cse11))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem63#1.base| v_ArrVal_3609) .cse6 v_ArrVal_3593)) (.cse2 (+ .cse9 4)) (.cse1 (select (select .cse8 .cse10) .cse11))) (or (< v_z_10 0) (< v_z_9 0) (< v_z_8 0) (< 255 v_z_10) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 20))) (store (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 24))) (store (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3 (select v_ArrVal_3595 .cse3))) .cse4 (select v_ArrVal_3595 .cse4))) v_ArrVal_3595)) (< 255 v_z_8) (not (= v_ArrVal_3590 (store (select .cse5 .cse6) .cse7 (select v_ArrVal_3590 .cse7)))) (< 0 (mod (+ (mod (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3595) (select (select (store (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_3596)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_3594) .cse1) .cse9) v_ArrVal_3602) .cse1 v_ArrVal_3603) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 4)) 256) (* v_z_10 16777216) (* 256 v_z_8) 17973517 (* 65536 v_z_9)) 4294967296)) (< 255 v_z_9))))))))) is different from false [2025-03-04 14:55:31,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119907696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:31,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:55:31,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2025-03-04 14:55:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340767317] [2025-03-04 14:55:31,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:55:31,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:55:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:31,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:55:31,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=442, Unknown=13, NotChecked=336, Total=870 [2025-03-04 14:55:31,550 INFO L87 Difference]: Start difference. First operand 1303 states and 1853 transitions. Second operand has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 14:55:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:35,088 INFO L93 Difference]: Finished difference Result 2582 states and 3668 transitions. [2025-03-04 14:55:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 14:55:35,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 190 [2025-03-04 14:55:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:35,094 INFO L225 Difference]: With dead ends: 2582 [2025-03-04 14:55:35,094 INFO L226 Difference]: Without dead ends: 1460 [2025-03-04 14:55:35,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=657, Unknown=13, NotChecked=406, Total=1190 [2025-03-04 14:55:35,097 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 998 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 6029 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 6029 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 14:55:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-04 14:55:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1312. [2025-03-04 14:55:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1268 states have (on average 1.416403785488959) internal successors, (1796), 1295 states have internal predecessors, (1796), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1864 transitions. [2025-03-04 14:55:35,124 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1864 transitions. Word has length 190 [2025-03-04 14:55:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:35,124 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1864 transitions. [2025-03-04 14:55:35,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 14:55:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1864 transitions. [2025-03-04 14:55:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 14:55:35,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:35,126 INFO L218 NwaCegarLoop]: trace histogram [6, 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-04 14:55:35,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:35,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:35,326 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-04 14:55:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1225807933, now seen corresponding path program 2 times [2025-03-04 14:55:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:35,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131297945] [2025-03-04 14:55:35,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:55:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:35,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-04 14:55:35,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 14:55:35,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:55:35,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:36,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131297945] [2025-03-04 14:55:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131297945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011737051] [2025-03-04 14:55:36,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:55:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:36,211 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-04 14:55:36,214 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-04 14:55:36,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-04 14:55:36,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 14:55:36,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:55:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:36,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:55:36,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:36,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011737051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:36,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 14:55:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664023783] [2025-03-04 14:55:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:36,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:55:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:36,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:55:36,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:55:36,946 INFO L87 Difference]: Start difference. First operand 1312 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-04 14:55:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:37,517 INFO L93 Difference]: Finished difference Result 2493 states and 3555 transitions. [2025-03-04 14:55:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:55:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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 192 [2025-03-04 14:55:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:37,523 INFO L225 Difference]: With dead ends: 2493 [2025-03-04 14:55:37,523 INFO L226 Difference]: Without dead ends: 1326 [2025-03-04 14:55:37,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:55:37,526 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 12 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:37,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3461 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:55:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-04 14:55:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1312. [2025-03-04 14:55:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1268 states have (on average 1.416403785488959) internal successors, (1796), 1295 states have internal predecessors, (1796), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1864 transitions. [2025-03-04 14:55:37,549 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1864 transitions. Word has length 192 [2025-03-04 14:55:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1864 transitions. [2025-03-04 14:55:37,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-04 14:55:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1864 transitions. [2025-03-04 14:55:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 14:55:37,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:37,551 INFO L218 NwaCegarLoop]: trace histogram [6, 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-04 14:55:37,563 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-04 14:55:37,752 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,SelfDestructingSolverStorable14 [2025-03-04 14:55:37,752 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-04 14:55:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -699315049, now seen corresponding path program 1 times [2025-03-04 14:55:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468831252] [2025-03-04 14:55:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 14:55:37,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 14:55:37,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:37,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:38,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:38,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468831252] [2025-03-04 14:55:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468831252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 14:55:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151226201] [2025-03-04 14:55:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:55:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:38,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:55:38,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:55:38,172 INFO L87 Difference]: Start difference. First operand 1312 states and 1864 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 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-04 14:55:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:38,679 INFO L93 Difference]: Finished difference Result 2500 states and 3561 transitions. [2025-03-04 14:55:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:55:38,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 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 193 [2025-03-04 14:55:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:38,683 INFO L225 Difference]: With dead ends: 2500 [2025-03-04 14:55:38,684 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 14:55:38,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:55:38,686 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 20 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:38,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3594 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:55:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 14:55:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1326. [2025-03-04 14:55:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1282 states have (on average 1.4149765990639624) internal successors, (1814), 1309 states have internal predecessors, (1814), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1882 transitions. [2025-03-04 14:55:38,708 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1882 transitions. Word has length 193 [2025-03-04 14:55:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:38,708 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1882 transitions. [2025-03-04 14:55:38,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 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-04 14:55:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1882 transitions. [2025-03-04 14:55:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 14:55:38,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:38,711 INFO L218 NwaCegarLoop]: trace histogram [6, 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-04 14:55:38,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:55:38,711 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-04 14:55:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1456271832, now seen corresponding path program 1 times [2025-03-04 14:55:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:38,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786611646] [2025-03-04 14:55:38,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 14:55:39,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 14:55:39,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:39,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786611646] [2025-03-04 14:55:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786611646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542263124] [2025-03-04 14:55:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:39,685 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-04 14:55:39,687 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-04 14:55:40,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 14:55:40,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 14:55:40,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:40,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:40,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 14:55:40,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:40,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542263124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2025-03-04 14:55:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809522122] [2025-03-04 14:55:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:40,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:55:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:40,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:55:40,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:55:40,321 INFO L87 Difference]: Start difference. First operand 1326 states and 1882 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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-04 14:55:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:41,644 INFO L93 Difference]: Finished difference Result 2521 states and 3588 transitions. [2025-03-04 14:55:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:55:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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 193 [2025-03-04 14:55:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:41,649 INFO L225 Difference]: With dead ends: 2521 [2025-03-04 14:55:41,649 INFO L226 Difference]: Without dead ends: 1352 [2025-03-04 14:55:41,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:55:41,651 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 17 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:41,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4053 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 14:55:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-04 14:55:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1336. [2025-03-04 14:55:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1292 states have (on average 1.4133126934984521) internal successors, (1826), 1319 states have internal predecessors, (1826), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1894 transitions. [2025-03-04 14:55:41,693 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1894 transitions. Word has length 193 [2025-03-04 14:55:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1894 transitions. [2025-03-04 14:55:41,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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-04 14:55:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1894 transitions. [2025-03-04 14:55:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 14:55:41,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:41,695 INFO L218 NwaCegarLoop]: trace histogram [6, 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-04 14:55:41,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:55:41,896 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-04 14:55:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 289161245, now seen corresponding path program 1 times [2025-03-04 14:55:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483041830] [2025-03-04 14:55:41,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:41,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 14:55:41,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 14:55:41,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:41,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483041830] [2025-03-04 14:55:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483041830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 14:55:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468337082] [2025-03-04 14:55:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:55:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:42,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:55:42,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:55:42,416 INFO L87 Difference]: Start difference. First operand 1336 states and 1894 transitions. Second operand has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 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-04 14:55:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:43,010 INFO L93 Difference]: Finished difference Result 2533 states and 3604 transitions. [2025-03-04 14:55:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:55:43,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 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 194 [2025-03-04 14:55:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:43,015 INFO L225 Difference]: With dead ends: 2533 [2025-03-04 14:55:43,015 INFO L226 Difference]: Without dead ends: 1354 [2025-03-04 14:55:43,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:55:43,017 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 23 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:43,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4662 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:55:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-04 14:55:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1342. [2025-03-04 14:55:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1298 states have (on average 1.411402157164869) internal successors, (1832), 1325 states have internal predecessors, (1832), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1900 transitions. [2025-03-04 14:55:43,039 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1900 transitions. Word has length 194 [2025-03-04 14:55:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:43,039 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1900 transitions. [2025-03-04 14:55:43,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 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-04 14:55:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1900 transitions. [2025-03-04 14:55:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 14:55:43,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:43,041 INFO L218 NwaCegarLoop]: trace histogram [6, 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-04 14:55:43,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:55:43,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1607122180, now seen corresponding path program 1 times [2025-03-04 14:55:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087505723] [2025-03-04 14:55:43,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:43,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 14:55:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 14:55:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087505723] [2025-03-04 14:55:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087505723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609716192] [2025-03-04 14:55:43,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:43,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:43,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:55:44,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 14:55:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 14:55:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:44,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 14:55:44,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 14:55:44,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609716192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 14:55:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585423469] [2025-03-04 14:55:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:55:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:44,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:55:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:55:44,889 INFO L87 Difference]: Start difference. First operand 1342 states and 1900 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 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-04 14:55:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:45,246 INFO L93 Difference]: Finished difference Result 2410 states and 3439 transitions. [2025-03-04 14:55:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:55:45,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 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 194 [2025-03-04 14:55:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:45,251 INFO L225 Difference]: With dead ends: 2410 [2025-03-04 14:55:45,251 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 14:55:45,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:55:45,253 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 30 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4358 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:55:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 14:55:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1356. [2025-03-04 14:55:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1312 states have (on average 1.4085365853658536) internal successors, (1848), 1339 states have internal predecessors, (1848), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1916 transitions. [2025-03-04 14:55:45,273 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1916 transitions. Word has length 194 [2025-03-04 14:55:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:45,273 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1916 transitions. [2025-03-04 14:55:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 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-04 14:55:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1916 transitions. [2025-03-04 14:55:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 14:55:45,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:45,275 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1] [2025-03-04 14:55:45,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:55:45,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:45,475 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:45,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -250073338, now seen corresponding path program 1 times [2025-03-04 14:55:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292675707] [2025-03-04 14:55:45,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:45,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 14:55:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 14:55:45,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292675707] [2025-03-04 14:55:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292675707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:45,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:55:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659728760] [2025-03-04 14:55:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:55:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:45,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:55:45,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:55:45,829 INFO L87 Difference]: Start difference. First operand 1356 states and 1916 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-04 14:55:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:46,131 INFO L93 Difference]: Finished difference Result 2404 states and 3422 transitions. [2025-03-04 14:55:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:55:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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 195 [2025-03-04 14:55:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:46,136 INFO L225 Difference]: With dead ends: 2404 [2025-03-04 14:55:46,136 INFO L226 Difference]: Without dead ends: 1352 [2025-03-04 14:55:46,137 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-04 14:55:46,138 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 13 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:46,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3093 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:55:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-04 14:55:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2025-03-04 14:55:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1306 states have (on average 1.4073506891271057) internal successors, (1838), 1333 states have internal predecessors, (1838), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1906 transitions. [2025-03-04 14:55:46,156 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1906 transitions. Word has length 195 [2025-03-04 14:55:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:46,156 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1906 transitions. [2025-03-04 14:55:46,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-04 14:55:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1906 transitions. [2025-03-04 14:55:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 14:55:46,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:46,157 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2025-03-04 14:55:46,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:55:46,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -922101569, now seen corresponding path program 1 times [2025-03-04 14:55:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491820699] [2025-03-04 14:55:46,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 14:55:46,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 14:55:46,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491820699] [2025-03-04 14:55:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491820699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:55:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:55:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817801859] [2025-03-04 14:55:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:55:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:55:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:55:46,452 INFO L87 Difference]: Start difference. First operand 1350 states and 1906 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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-04 14:55:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:46,748 INFO L93 Difference]: Finished difference Result 2403 states and 3419 transitions. [2025-03-04 14:55:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:55:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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 196 [2025-03-04 14:55:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:46,753 INFO L225 Difference]: With dead ends: 2403 [2025-03-04 14:55:46,753 INFO L226 Difference]: Without dead ends: 1356 [2025-03-04 14:55:46,754 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-04 14:55:46,755 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:46,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3111 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:55:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-04 14:55:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2025-03-04 14:55:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1312 states have (on average 1.4054878048780488) internal successors, (1844), 1339 states have internal predecessors, (1844), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1912 transitions. [2025-03-04 14:55:46,773 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1912 transitions. Word has length 196 [2025-03-04 14:55:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:46,773 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1912 transitions. [2025-03-04 14:55:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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-04 14:55:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1912 transitions. [2025-03-04 14:55:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 14:55:46,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:46,774 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2025-03-04 14:55:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:55:46,774 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 312634344, now seen corresponding path program 1 times [2025-03-04 14:55:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645046739] [2025-03-04 14:55:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:47,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:47,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:47,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645046739] [2025-03-04 14:55:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645046739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010465503] [2025-03-04 14:55:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:47,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:47,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:55:47,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:48,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:48,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:48,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:48,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 14:55:48,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:48,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010465503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 14:55:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348501465] [2025-03-04 14:55:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:55:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:48,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:55:48,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:55:48,376 INFO L87 Difference]: Start difference. First operand 1356 states and 1912 transitions. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-04 14:55:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:49,556 INFO L93 Difference]: Finished difference Result 2576 states and 3648 transitions. [2025-03-04 14:55:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:55:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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 197 [2025-03-04 14:55:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:49,561 INFO L225 Difference]: With dead ends: 2576 [2025-03-04 14:55:49,561 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 14:55:49,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:55:49,563 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 17 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5187 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 14:55:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 14:55:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1370. [2025-03-04 14:55:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1326 states have (on average 1.4042232277526394) internal successors, (1862), 1353 states have internal predecessors, (1862), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1930 transitions. [2025-03-04 14:55:49,580 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1930 transitions. Word has length 197 [2025-03-04 14:55:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:49,580 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1930 transitions. [2025-03-04 14:55:49,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-04 14:55:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1930 transitions. [2025-03-04 14:55:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 14:55:49,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:49,581 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2025-03-04 14:55:49,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 14:55:49,782 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 48526664, now seen corresponding path program 1 times [2025-03-04 14:55:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331311871] [2025-03-04 14:55:49,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:49,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:49,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:49,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:49,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331311871] [2025-03-04 14:55:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331311871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712752253] [2025-03-04 14:55:50,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:50,204 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:50,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:55:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:50,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:50,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:50,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 14:55:50,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:55:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:55:50,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:55:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712752253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:55:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:55:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 14:55:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256810161] [2025-03-04 14:55:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:55:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:55:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:55:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:55:50,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:55:50,833 INFO L87 Difference]: Start difference. First operand 1370 states and 1930 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:55:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:55:51,228 INFO L93 Difference]: Finished difference Result 2596 states and 3672 transitions. [2025-03-04 14:55:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:55:51,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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 197 [2025-03-04 14:55:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:55:51,233 INFO L225 Difference]: With dead ends: 2596 [2025-03-04 14:55:51,233 INFO L226 Difference]: Without dead ends: 1398 [2025-03-04 14:55:51,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:55:51,234 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 39 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:55:51,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3527 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:55:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-04 14:55:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2025-03-04 14:55:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1340 states have (on average 1.4044776119402984) internal successors, (1882), 1367 states have internal predecessors, (1882), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:55:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1950 transitions. [2025-03-04 14:55:51,251 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1950 transitions. Word has length 197 [2025-03-04 14:55:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:55:51,251 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1950 transitions. [2025-03-04 14:55:51,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:55:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1950 transitions. [2025-03-04 14:55:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 14:55:51,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:55:51,253 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2025-03-04 14:55:51,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:55:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:51,453 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:55:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:55:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 747877252, now seen corresponding path program 1 times [2025-03-04 14:55:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:55:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915683361] [2025-03-04 14:55:51,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:55:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:55:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:55:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915683361] [2025-03-04 14:55:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915683361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:55:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327167193] [2025-03-04 14:55:52,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:55:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:55:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:55:52,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:55:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:55:52,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:55:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:55:53,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:55:53,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:55:53,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:55:53,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:56:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 14:56:04,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:56:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327167193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:56:04,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:56:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 14:56:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955089797] [2025-03-04 14:56:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:56:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:56:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:56:04,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:56:04,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:56:04,220 INFO L87 Difference]: Start difference. First operand 1384 states and 1950 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-04 14:56:08,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:56:10,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:56:12,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:56:16,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:56:21,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 14:56:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:56:22,048 INFO L93 Difference]: Finished difference Result 2451 states and 3480 transitions. [2025-03-04 14:56:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:56:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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 197 [2025-03-04 14:56:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:56:22,053 INFO L225 Difference]: With dead ends: 2451 [2025-03-04 14:56:22,053 INFO L226 Difference]: Without dead ends: 1394 [2025-03-04 14:56:22,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:56:22,054 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 12 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2025-03-04 14:56:22,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3710 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2025-03-04 14:56:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-04 14:56:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1392. [2025-03-04 14:56:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:56:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 14:56:22,073 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 14:56:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:56:22,073 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 14:56:22,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 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-04 14:56:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 14:56:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 14:56:22,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:56:22,075 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2025-03-04 14:56:22,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 14:56:22,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 14:56:22,276 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:56:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:56:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash 398231416, now seen corresponding path program 1 times [2025-03-04 14:56:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:56:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108235709] [2025-03-04 14:56:22,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:56:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:56:22,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:56:22,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:56:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:56:22,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:56:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:56:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:56:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108235709] [2025-03-04 14:56:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108235709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:56:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:56:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:56:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829911202] [2025-03-04 14:56:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:56:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:56:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:56:22,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:56:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:56:22,560 INFO L87 Difference]: Start difference. First operand 1392 states and 1960 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:56:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:56:22,947 INFO L93 Difference]: Finished difference Result 2463 states and 3495 transitions. [2025-03-04 14:56:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:56:22,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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 197 [2025-03-04 14:56:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:56:22,951 INFO L225 Difference]: With dead ends: 2463 [2025-03-04 14:56:22,951 INFO L226 Difference]: Without dead ends: 1402 [2025-03-04 14:56:22,952 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-04 14:56:22,952 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 12 mSDsluCounter, 3045 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:56:22,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3716 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:56:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-04 14:56:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1392. [2025-03-04 14:56:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:56:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 14:56:22,966 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 14:56:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:56:22,966 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 14:56:22,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:56:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 14:56:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 14:56:22,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:56:22,967 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2025-03-04 14:56:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 14:56:22,967 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:56:22,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:56:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1814514509, now seen corresponding path program 1 times [2025-03-04 14:56:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:56:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060658555] [2025-03-04 14:56:22,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:56:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:56:23,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:56:23,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:56:23,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:56:23,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:56:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:56:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:56:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060658555] [2025-03-04 14:56:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060658555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:56:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772668111] [2025-03-04 14:56:23,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:56:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:56:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:56:23,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:56:23,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:56:24,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 14:56:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 14:56:24,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:56:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:56:24,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 14:56:24,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:56:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 14:56:24,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:56:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772668111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:56:24,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:56:24,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 14:56:24,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629080786] [2025-03-04 14:56:24,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:56:24,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:56:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:56:24,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:56:24,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:56:24,407 INFO L87 Difference]: Start difference. First operand 1392 states and 1960 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:56:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:56:25,024 INFO L93 Difference]: Finished difference Result 2620 states and 3704 transitions. [2025-03-04 14:56:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:56:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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 197 [2025-03-04 14:56:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:56:25,027 INFO L225 Difference]: With dead ends: 2620 [2025-03-04 14:56:25,027 INFO L226 Difference]: Without dead ends: 1402 [2025-03-04 14:56:25,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 14:56:25,028 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 10 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:56:25,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3455 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:56:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-04 14:56:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1392. [2025-03-04 14:56:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1348 states have (on average 1.403560830860534) internal successors, (1892), 1375 states have internal predecessors, (1892), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:56:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1960 transitions. [2025-03-04 14:56:25,045 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1960 transitions. Word has length 197 [2025-03-04 14:56:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:56:25,045 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1960 transitions. [2025-03-04 14:56:25,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-04 14:56:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1960 transitions. [2025-03-04 14:56:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 14:56:25,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:56:25,047 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1] [2025-03-04 14:56:25,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:56:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 14:56:25,248 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:56:25,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:56:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash -536074449, now seen corresponding path program 1 times [2025-03-04 14:56:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:56:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219237081] [2025-03-04 14:56:25,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:56:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:56:25,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 14:56:25,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 14:56:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:56:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:56:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 14:56:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:56:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219237081] [2025-03-04 14:56:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219237081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:56:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891713361] [2025-03-04 14:56:25,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:56:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:56:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:56:25,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:56:25,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:56:26,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 14:56:26,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 14:56:26,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:56:26,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:56:26,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 238 conjuncts are in the unsatisfiable core [2025-03-04 14:56:26,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:56:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 14:56:26,649 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 11 treesize of output 7 [2025-03-04 14:56:26,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-03-04 14:56:26,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-04 14:56:26,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 14:56:26,961 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 14:56:26,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-04 14:56:26,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-04 14:56:26,974 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 11 treesize of output 7 [2025-03-04 14:56:27,043 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 18 treesize of output 10 [2025-03-04 14:56:27,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 14:56:27,049 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-04 14:56:27,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 14:56:27,240 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 66 treesize of output 57 [2025-03-04 14:56:27,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 11 [2025-03-04 14:56:27,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 16 [2025-03-04 14:56:28,982 INFO L190 IndexEqualityManager]: detected not equals via solver