./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:19:38,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:19:38,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:19:38,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:19:38,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:19:38,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:19:38,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:19:38,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:19:38,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:19:38,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:19:38,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:19:38,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:19:38,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:19:38,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:19:38,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:19:38,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:19:38,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:19:38,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:19:38,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:19:38,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:19:38,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:19:38,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:19:38,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:19:38,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:19:38,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:19:38,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:19:38,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:19:38,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:19:38,595 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-17 19:19:38,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:19:38,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:19:38,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:19:38,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:19:38,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:19:38,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2025-03-17 19:19:39,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4077b91e3/ca17f1753f464702b6d6e774bd57f8de/FLAG4e8f07143 [2025-03-17 19:19:40,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:19:40,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2025-03-17 19:19:40,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4077b91e3/ca17f1753f464702b6d6e774bd57f8de/FLAG4e8f07143 [2025-03-17 19:19:40,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4077b91e3/ca17f1753f464702b6d6e774bd57f8de [2025-03-17 19:19:40,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:19:40,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:19:40,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:19:40,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:19:40,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:19:40,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:40,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f469640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40, skipping insertion in model container [2025-03-17 19:19:40,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:40,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:19:40,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:19:40,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:19:40,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:19:40,912 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:19:40,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40 WrapperNode [2025-03-17 19:19:40,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:19:40,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:19:40,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:19:40,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:19:40,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:40,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:40,978 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-03-17 19:19:40,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:19:40,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:19:40,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:19:40,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:19:40,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:40,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,047 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-17 19:19:41,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:19:41,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:19:41,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:19:41,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:19:41,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (1/1) ... [2025-03-17 19:19:41,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:19:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:41,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:19:41,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:19:41,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 19:19:41,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:19:41,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:19:41,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:19:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:19:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:19:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:19:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:19:41,295 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:19:41,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:19:42,238 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 19:19:42,308 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-03-17 19:19:42,308 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:19:42,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:19:42,352 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:19:42,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:19:42 BoogieIcfgContainer [2025-03-17 19:19:42,352 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:19:42,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:19:42,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:19:42,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:19:42,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:19:40" (1/3) ... [2025-03-17 19:19:42,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f409a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:19:42, skipping insertion in model container [2025-03-17 19:19:42,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:19:40" (2/3) ... [2025-03-17 19:19:42,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f409a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:19:42, skipping insertion in model container [2025-03-17 19:19:42,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:19:42" (3/3) ... [2025-03-17 19:19:42,360 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2025-03-17 19:19:42,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:19:42,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test2-1.i that has 4 procedures, 379 locations, 1 initial locations, 31 loop locations, and 6 error locations. [2025-03-17 19:19:42,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:19:42,423 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;@58af95b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:19:42,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:19:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 360 states have (on average 1.625) internal successors, (585), 366 states have internal predecessors, (585), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:19:42,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:42,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:42,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:42,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -393905353, now seen corresponding path program 1 times [2025-03-17 19:19:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291277134] [2025-03-17 19:19:42,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:42,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:42,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:19:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:19:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:42,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:42,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291277134] [2025-03-17 19:19:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291277134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:19:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410165725] [2025-03-17 19:19:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:42,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:19:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:42,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:19:42,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:19:42,583 INFO L87 Difference]: Start difference. First operand has 371 states, 360 states have (on average 1.625) internal successors, (585), 366 states have internal predecessors, (585), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:42,668 INFO L93 Difference]: Finished difference Result 739 states and 1178 transitions. [2025-03-17 19:19:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:19:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:19:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:42,678 INFO L225 Difference]: With dead ends: 739 [2025-03-17 19:19:42,678 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 19:19:42,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:19:42,682 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:42,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 19:19:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-17 19:19:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.4704225352112676) internal successors, (522), 360 states have internal predecessors, (522), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 528 transitions. [2025-03-17 19:19:42,726 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 528 transitions. Word has length 7 [2025-03-17 19:19:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 528 transitions. [2025-03-17 19:19:42,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 528 transitions. [2025-03-17 19:19:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:19:42,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:42,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:42,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:19:42,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash -393904392, now seen corresponding path program 1 times [2025-03-17 19:19:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117838444] [2025-03-17 19:19:42,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:42,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:19:42,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:19:42,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:42,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:19:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272422051] [2025-03-17 19:19:42,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:42,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:42,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:19:42,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:19:42,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:19:42,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:42,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:42,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:19:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:42,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:19:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:42,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117838444] [2025-03-17 19:19:42,932 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:19:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272422051] [2025-03-17 19:19:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272422051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:19:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926021552] [2025-03-17 19:19:42,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:42,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:42,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:42,935 INFO L87 Difference]: Start difference. First operand 365 states and 528 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:43,152 INFO L93 Difference]: Finished difference Result 724 states and 1050 transitions. [2025-03-17 19:19:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:19:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:19:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:43,156 INFO L225 Difference]: With dead ends: 724 [2025-03-17 19:19:43,156 INFO L226 Difference]: Without dead ends: 722 [2025-03-17 19:19:43,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:43,157 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 509 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1386 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:19:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-17 19:19:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 371. [2025-03-17 19:19:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 361 states have (on average 1.4653739612188366) internal successors, (529), 366 states have internal predecessors, (529), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 535 transitions. [2025-03-17 19:19:43,184 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 535 transitions. Word has length 7 [2025-03-17 19:19:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:43,184 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 535 transitions. [2025-03-17 19:19:43,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 535 transitions. [2025-03-17 19:19:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 19:19:43,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:43,189 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] [2025-03-17 19:19:43,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:19:43,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:43,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1762714397, now seen corresponding path program 1 times [2025-03-17 19:19:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524455165] [2025-03-17 19:19:43,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:43,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:19:43,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:19:43,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:43,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524455165] [2025-03-17 19:19:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524455165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:19:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703485798] [2025-03-17 19:19:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:43,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:43,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:43,640 INFO L87 Difference]: Start difference. First operand 371 states and 535 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:43,767 INFO L93 Difference]: Finished difference Result 487 states and 702 transitions. [2025-03-17 19:19:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:19:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-17 19:19:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:43,768 INFO L225 Difference]: With dead ends: 487 [2025-03-17 19:19:43,769 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 19:19:43,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:43,770 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 36 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:43,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1162 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 19:19:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-17 19:19:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 319 states have (on average 1.4169278996865204) internal successors, (452), 324 states have internal predecessors, (452), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 458 transitions. [2025-03-17 19:19:43,783 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 458 transitions. Word has length 64 [2025-03-17 19:19:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:43,783 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 458 transitions. [2025-03-17 19:19:43,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 458 transitions. [2025-03-17 19:19:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 19:19:43,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:43,786 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] [2025-03-17 19:19:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:19:43,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1928595795, now seen corresponding path program 1 times [2025-03-17 19:19:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304089728] [2025-03-17 19:19:43,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:43,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:19:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:19:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304089728] [2025-03-17 19:19:43,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304089728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:43,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:43,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:19:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331328263] [2025-03-17 19:19:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:43,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:43,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:43,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:43,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:43,911 INFO L87 Difference]: Start difference. First operand 329 states and 458 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:44,023 INFO L93 Difference]: Finished difference Result 439 states and 608 transitions. [2025-03-17 19:19:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:19:44,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-17 19:19:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:44,025 INFO L225 Difference]: With dead ends: 439 [2025-03-17 19:19:44,026 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 19:19:44,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:44,027 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 9 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:44,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1163 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 19:19:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-17 19:19:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 313 states have (on average 1.4121405750798721) internal successors, (442), 318 states have internal predecessors, (442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2025-03-17 19:19:44,040 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 64 [2025-03-17 19:19:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:44,040 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2025-03-17 19:19:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2025-03-17 19:19:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 19:19:44,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:44,042 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] [2025-03-17 19:19:44,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:19:44,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:44,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash 153386839, now seen corresponding path program 1 times [2025-03-17 19:19:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:44,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793698707] [2025-03-17 19:19:44,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:44,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:19:44,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:19:44,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:44,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793698707] [2025-03-17 19:19:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793698707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:19:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914151604] [2025-03-17 19:19:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:44,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:44,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:44,273 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:44,422 INFO L93 Difference]: Finished difference Result 626 states and 874 transitions. [2025-03-17 19:19:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:19:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-17 19:19:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:44,426 INFO L225 Difference]: With dead ends: 626 [2025-03-17 19:19:44,427 INFO L226 Difference]: Without dead ends: 624 [2025-03-17 19:19:44,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:44,428 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 366 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:44,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1178 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-17 19:19:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 431. [2025-03-17 19:19:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 421 states have (on average 1.3919239904988123) internal successors, (586), 426 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2025-03-17 19:19:44,449 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 64 [2025-03-17 19:19:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:44,450 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2025-03-17 19:19:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2025-03-17 19:19:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:19:44,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:44,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:19:44,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:44,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash 517123816, now seen corresponding path program 1 times [2025-03-17 19:19:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777455627] [2025-03-17 19:19:44,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:19:44,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:19:44,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:44,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777455627] [2025-03-17 19:19:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777455627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:44,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:19:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442023213] [2025-03-17 19:19:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:44,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:44,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:44,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:44,689 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:44,776 INFO L93 Difference]: Finished difference Result 812 states and 1109 transitions. [2025-03-17 19:19:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:19:44,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-17 19:19:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:44,778 INFO L225 Difference]: With dead ends: 812 [2025-03-17 19:19:44,778 INFO L226 Difference]: Without dead ends: 389 [2025-03-17 19:19:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:44,780 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 30 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:44,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 932 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-17 19:19:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-17 19:19:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.3430079155672823) internal successors, (509), 384 states have internal predecessors, (509), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 515 transitions. [2025-03-17 19:19:44,787 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 515 transitions. Word has length 79 [2025-03-17 19:19:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 515 transitions. [2025-03-17 19:19:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 515 transitions. [2025-03-17 19:19:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:19:44,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:44,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:19:44,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:44,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash -868819903, now seen corresponding path program 1 times [2025-03-17 19:19:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702388176] [2025-03-17 19:19:44,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:44,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:19:44,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:19:44,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:44,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702388176] [2025-03-17 19:19:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702388176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:19:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132363114] [2025-03-17 19:19:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:19:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:44,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:19:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:19:44,889 INFO L87 Difference]: Start difference. First operand 389 states and 515 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:44,977 INFO L93 Difference]: Finished difference Result 1030 states and 1369 transitions. [2025-03-17 19:19:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:19:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-17 19:19:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:44,980 INFO L225 Difference]: With dead ends: 1030 [2025-03-17 19:19:44,981 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 19:19:44,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:19:44,981 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 176 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:44,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 653 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 19:19:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2025-03-17 19:19:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 637 states have (on average 1.3406593406593406) internal successors, (854), 642 states have internal predecessors, (854), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 19:19:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 860 transitions. [2025-03-17 19:19:44,995 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 860 transitions. Word has length 79 [2025-03-17 19:19:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:44,995 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 860 transitions. [2025-03-17 19:19:44,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:19:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 860 transitions. [2025-03-17 19:19:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 19:19:44,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:44,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:44,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:19:44,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1528258687, now seen corresponding path program 1 times [2025-03-17 19:19:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451162263] [2025-03-17 19:19:44,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:45,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 19:19:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 19:19:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:45,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:45,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451162263] [2025-03-17 19:19:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451162263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:45,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:45,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:19:45,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653819490] [2025-03-17 19:19:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:45,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:45,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:45,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:19:45,296 INFO L87 Difference]: Start difference. First operand 647 states and 860 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:45,403 INFO L93 Difference]: Finished difference Result 712 states and 945 transitions. [2025-03-17 19:19:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:19:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-17 19:19:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:45,406 INFO L225 Difference]: With dead ends: 712 [2025-03-17 19:19:45,406 INFO L226 Difference]: Without dead ends: 710 [2025-03-17 19:19:45,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:45,407 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 255 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:45,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1034 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:19:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-17 19:19:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-03-17 19:19:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 697 states have (on average 1.3357245337159254) internal successors, (931), 702 states have internal predecessors, (931), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 943 transitions. [2025-03-17 19:19:45,421 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 943 transitions. Word has length 94 [2025-03-17 19:19:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 943 transitions. [2025-03-17 19:19:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 943 transitions. [2025-03-17 19:19:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 19:19:45,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:45,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:19:45,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -433544560, now seen corresponding path program 1 times [2025-03-17 19:19:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196048577] [2025-03-17 19:19:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:19:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:19:45,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196048577] [2025-03-17 19:19:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196048577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619333832] [2025-03-17 19:19:45,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:45,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:45,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:45,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:19:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:19:45,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:19:45,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:45,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:46,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:19:46,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:46,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:19:46,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:19:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 19:19:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:46,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619333832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-17 19:19:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870584472] [2025-03-17 19:19:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:19:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:19:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:19:46,598 INFO L87 Difference]: Start difference. First operand 710 states and 943 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:47,967 INFO L93 Difference]: Finished difference Result 1310 states and 1741 transitions. [2025-03-17 19:19:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:19:47,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-17 19:19:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:47,969 INFO L225 Difference]: With dead ends: 1310 [2025-03-17 19:19:47,970 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 19:19:47,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:19:47,971 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 461 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:47,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 2083 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 19:19:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 19:19:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 710. [2025-03-17 19:19:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 697 states have (on average 1.33428981348637) internal successors, (930), 702 states have internal predecessors, (930), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 942 transitions. [2025-03-17 19:19:47,988 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 942 transitions. Word has length 100 [2025-03-17 19:19:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:47,988 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 942 transitions. [2025-03-17 19:19:47,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 942 transitions. [2025-03-17 19:19:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 19:19:47,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:47,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:47,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:19:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 19:19:48,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1861793230, now seen corresponding path program 1 times [2025-03-17 19:19:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202211615] [2025-03-17 19:19:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:48,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 19:19:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 19:19:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:48,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:48,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202211615] [2025-03-17 19:19:48,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202211615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:48,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611657206] [2025-03-17 19:19:48,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:48,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:48,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:48,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:48,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:19:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 19:19:48,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 19:19:48,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:48,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:19:48,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:48,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611657206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:19:48,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110988886] [2025-03-17 19:19:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:19:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:48,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:19:48,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:19:48,958 INFO L87 Difference]: Start difference. First operand 710 states and 942 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:49,261 INFO L93 Difference]: Finished difference Result 1306 states and 1742 transitions. [2025-03-17 19:19:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:19:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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 101 [2025-03-17 19:19:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:49,263 INFO L225 Difference]: With dead ends: 1306 [2025-03-17 19:19:49,263 INFO L226 Difference]: Without dead ends: 720 [2025-03-17 19:19:49,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:19:49,265 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 15 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:49,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1616 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:19:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-17 19:19:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 718. [2025-03-17 19:19:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 705 states have (on average 1.3304964539007091) internal successors, (938), 710 states have internal predecessors, (938), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions. [2025-03-17 19:19:49,279 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 101 [2025-03-17 19:19:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:49,279 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions. [2025-03-17 19:19:49,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions. [2025-03-17 19:19:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 19:19:49,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:49,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:49,288 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-17 19:19:49,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:49,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash 811537895, now seen corresponding path program 1 times [2025-03-17 19:19:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54905227] [2025-03-17 19:19:49,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:49,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 19:19:49,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 19:19:49,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54905227] [2025-03-17 19:19:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54905227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:49,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:19:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906785574] [2025-03-17 19:19:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:19:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:49,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:19:49,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:19:49,704 INFO L87 Difference]: Start difference. First operand 718 states and 950 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:49,897 INFO L93 Difference]: Finished difference Result 1315 states and 1748 transitions. [2025-03-17 19:19:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:19:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-17 19:19:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:49,900 INFO L225 Difference]: With dead ends: 1315 [2025-03-17 19:19:49,900 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 19:19:49,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:19:49,901 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 8 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:49,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1126 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:19:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 19:19:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-03-17 19:19:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 711 states have (on average 1.3277074542897327) internal successors, (944), 716 states have internal predecessors, (944), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 956 transitions. [2025-03-17 19:19:49,916 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 956 transitions. Word has length 103 [2025-03-17 19:19:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:49,916 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 956 transitions. [2025-03-17 19:19:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 956 transitions. [2025-03-17 19:19:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 19:19:49,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:49,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:19:49,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1397851570, now seen corresponding path program 1 times [2025-03-17 19:19:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000203503] [2025-03-17 19:19:49,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:49,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 19:19:49,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 19:19:49,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000203503] [2025-03-17 19:19:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000203503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:50,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:19:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649835745] [2025-03-17 19:19:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:50,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:19:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:50,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:19:50,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:19:50,182 INFO L87 Difference]: Start difference. First operand 724 states and 956 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:50,459 INFO L93 Difference]: Finished difference Result 1317 states and 1747 transitions. [2025-03-17 19:19:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:19:50,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-17 19:19:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:50,462 INFO L225 Difference]: With dead ends: 1317 [2025-03-17 19:19:50,462 INFO L226 Difference]: Without dead ends: 734 [2025-03-17 19:19:50,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:19:50,464 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 12 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:50,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1616 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:19:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-17 19:19:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 724. [2025-03-17 19:19:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 711 states have (on average 1.3277074542897327) internal successors, (944), 716 states have internal predecessors, (944), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 956 transitions. [2025-03-17 19:19:50,482 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 956 transitions. Word has length 103 [2025-03-17 19:19:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:50,482 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 956 transitions. [2025-03-17 19:19:50,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 956 transitions. [2025-03-17 19:19:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 19:19:50,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:50,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:19:50,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2028281638, now seen corresponding path program 1 times [2025-03-17 19:19:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25063457] [2025-03-17 19:19:50,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:50,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:19:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:19:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25063457] [2025-03-17 19:19:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25063457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:50,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:19:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933481467] [2025-03-17 19:19:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:19:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:50,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:19:50,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:19:50,772 INFO L87 Difference]: Start difference. First operand 724 states and 956 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:51,082 INFO L93 Difference]: Finished difference Result 1322 states and 1751 transitions. [2025-03-17 19:19:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:19:51,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-17 19:19:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:51,085 INFO L225 Difference]: With dead ends: 1322 [2025-03-17 19:19:51,085 INFO L226 Difference]: Without dead ends: 744 [2025-03-17 19:19:51,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:19:51,086 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 20 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:51,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2199 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:19:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-17 19:19:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2025-03-17 19:19:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 725 states have (on average 1.326896551724138) internal successors, (962), 730 states have internal predecessors, (962), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 974 transitions. [2025-03-17 19:19:51,101 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 974 transitions. Word has length 104 [2025-03-17 19:19:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:51,101 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 974 transitions. [2025-03-17 19:19:51,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 974 transitions. [2025-03-17 19:19:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 19:19:51,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:51,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:19:51,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1040602984, now seen corresponding path program 1 times [2025-03-17 19:19:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271596920] [2025-03-17 19:19:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:51,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:19:51,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:19:51,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:51,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271596920] [2025-03-17 19:19:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271596920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496353466] [2025-03-17 19:19:51,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:51,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:51,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:19:51,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:19:51,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:19:51,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:51,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:19:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:51,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496353466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 19:19:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567232139] [2025-03-17 19:19:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:19:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:19:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:19:51,708 INFO L87 Difference]: Start difference. First operand 738 states and 974 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:52,087 INFO L93 Difference]: Finished difference Result 1347 states and 1782 transitions. [2025-03-17 19:19:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:19:52,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-17 19:19:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:52,091 INFO L225 Difference]: With dead ends: 1347 [2025-03-17 19:19:52,091 INFO L226 Difference]: Without dead ends: 762 [2025-03-17 19:19:52,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:19:52,092 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 40 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:52,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1914 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:19:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-17 19:19:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 748. [2025-03-17 19:19:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 735 states have (on average 1.325170068027211) internal successors, (974), 740 states have internal predecessors, (974), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 986 transitions. [2025-03-17 19:19:52,108 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 986 transitions. Word has length 104 [2025-03-17 19:19:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:52,109 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 986 transitions. [2025-03-17 19:19:52,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 986 transitions. [2025-03-17 19:19:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:19:52,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:52,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:52,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:19:52,310 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-17 19:19:52,310 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:52,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1381514457, now seen corresponding path program 1 times [2025-03-17 19:19:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695038700] [2025-03-17 19:19:52,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:52,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:52,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695038700] [2025-03-17 19:19:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695038700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:19:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 19:19:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661687337] [2025-03-17 19:19:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:52,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:19:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:52,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:19:52,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:19:52,681 INFO L87 Difference]: Start difference. First operand 748 states and 986 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:53,105 INFO L93 Difference]: Finished difference Result 1361 states and 1802 transitions. [2025-03-17 19:19:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:19:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 105 [2025-03-17 19:19:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:53,108 INFO L225 Difference]: With dead ends: 1361 [2025-03-17 19:19:53,109 INFO L226 Difference]: Without dead ends: 766 [2025-03-17 19:19:53,109 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-17 19:19:53,110 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 26 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:53,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2191 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:19:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-17 19:19:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 754. [2025-03-17 19:19:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 741 states have (on average 1.3225371120107963) internal successors, (980), 746 states have internal predecessors, (980), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 992 transitions. [2025-03-17 19:19:53,125 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 992 transitions. Word has length 105 [2025-03-17 19:19:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 992 transitions. [2025-03-17 19:19:53,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 992 transitions. [2025-03-17 19:19:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:19:53,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:53,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:53,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:19:53,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:53,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1934781659, now seen corresponding path program 1 times [2025-03-17 19:19:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:53,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297681366] [2025-03-17 19:19:53,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:53,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:53,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:53,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:53,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297681366] [2025-03-17 19:19:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297681366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430825386] [2025-03-17 19:19:53,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:53,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:53,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:19:53,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:53,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:53,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:19:53,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:54,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430825386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-17 19:19:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466380958] [2025-03-17 19:19:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:54,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:19:54,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:54,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:19:54,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:19:54,031 INFO L87 Difference]: Start difference. First operand 754 states and 992 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:54,897 INFO L93 Difference]: Finished difference Result 1372 states and 1816 transitions. [2025-03-17 19:19:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:19:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 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 105 [2025-03-17 19:19:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:54,900 INFO L225 Difference]: With dead ends: 1372 [2025-03-17 19:19:54,900 INFO L226 Difference]: Without dead ends: 774 [2025-03-17 19:19:54,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:19:54,901 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 18 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:54,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2677 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:19:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-03-17 19:19:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 768. [2025-03-17 19:19:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 755 states have (on average 1.3218543046357616) internal successors, (998), 760 states have internal predecessors, (998), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1010 transitions. [2025-03-17 19:19:54,916 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1010 transitions. Word has length 105 [2025-03-17 19:19:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:54,916 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1010 transitions. [2025-03-17 19:19:54,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1010 transitions. [2025-03-17 19:19:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:19:54,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:54,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:54,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:19:55,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 19:19:55,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 539364805, now seen corresponding path program 1 times [2025-03-17 19:19:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228520691] [2025-03-17 19:19:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:55,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:55,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:55,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:55,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228520691] [2025-03-17 19:19:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228520691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156664863] [2025-03-17 19:19:55,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:55,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:19:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:19:55,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:55,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:55,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:55,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:55,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:19:55,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:19:55,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156664863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:55,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:55,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:19:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789665091] [2025-03-17 19:19:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:55,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:19:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:55,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:19:55,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:19:55,673 INFO L87 Difference]: Start difference. First operand 768 states and 1010 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:55,921 INFO L93 Difference]: Finished difference Result 1382 states and 1824 transitions. [2025-03-17 19:19:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:19:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 105 [2025-03-17 19:19:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:55,924 INFO L225 Difference]: With dead ends: 1382 [2025-03-17 19:19:55,924 INFO L226 Difference]: Without dead ends: 782 [2025-03-17 19:19:55,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:19:55,926 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 39 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:55,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1628 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:19:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-17 19:19:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 772. [2025-03-17 19:19:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 759 states have (on average 1.3201581027667983) internal successors, (1002), 764 states have internal predecessors, (1002), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:19:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1014 transitions. [2025-03-17 19:19:55,941 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1014 transitions. Word has length 105 [2025-03-17 19:19:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1014 transitions. [2025-03-17 19:19:55,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:19:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1014 transitions. [2025-03-17 19:19:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:19:55,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:55,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:55,950 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-17 19:19:56,142 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-17 19:19:56,143 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2136442377, now seen corresponding path program 1 times [2025-03-17 19:19:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856667163] [2025-03-17 19:19:56,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:56,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:56,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:56,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:56,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:19:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856667163] [2025-03-17 19:19:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856667163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341842184] [2025-03-17 19:19:56,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:56,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:56,336 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-17 19:19:56,337 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-17 19:19:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:19:56,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:19:56,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:56,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:56,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:19:56,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:19:56,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:19:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341842184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:19:56,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:19:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 19:19:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800463859] [2025-03-17 19:19:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:19:56,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:19:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:19:56,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:19:56,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:56,768 INFO L87 Difference]: Start difference. First operand 772 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 19:19:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:19:56,818 INFO L93 Difference]: Finished difference Result 1342 states and 1768 transitions. [2025-03-17 19:19:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:19:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-03-17 19:19:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:19:56,822 INFO L225 Difference]: With dead ends: 1342 [2025-03-17 19:19:56,822 INFO L226 Difference]: Without dead ends: 775 [2025-03-17 19:19:56,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:19:56,823 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 0 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:19:56,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 989 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:19:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-17 19:19:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-03-17 19:19:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 767 states have internal predecessors, (1005), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 19:19:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1019 transitions. [2025-03-17 19:19:56,842 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1019 transitions. Word has length 105 [2025-03-17 19:19:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:19:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1019 transitions. [2025-03-17 19:19:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 19:19:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1019 transitions. [2025-03-17 19:19:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 19:19:56,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:19:56,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:19:56,862 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-17 19:19:57,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:57,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:19:57,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:19:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1471479117, now seen corresponding path program 1 times [2025-03-17 19:19:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:19:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642000465] [2025-03-17 19:19:57,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:19:57,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 19:19:57,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 19:19:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:19:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:19:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642000465] [2025-03-17 19:19:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642000465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:19:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536339809] [2025-03-17 19:19:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:19:57,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:19:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:19:57,257 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-17 19:19:57,259 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-17 19:19:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 19:19:57,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 19:19:57,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:19:57,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:19:57,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-17 19:19:57,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:19:57,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:19:57,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:19:57,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:19:57,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 19:19:57,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:19:57,996 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 19 treesize of output 1 [2025-03-17 19:19:58,014 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-17 19:19:58,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-03-17 19:19:58,023 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 13 treesize of output 9 [2025-03-17 19:19:58,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 19:19:58,084 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 9 treesize of output 3 [2025-03-17 19:19:58,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 19:19:58,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 19:19:58,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 19:20:01,872 INFO L224 Elim1Store]: Index analysis took 210 ms