./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.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_test4-3.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 c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:21:16,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:21:16,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:21:16,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:21:16,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:21:16,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:21:16,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:21:16,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:21:16,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:21:16,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:21:16,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:21:16,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:21:16,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:21:16,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:21:16,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:21:16,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:21:16,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:21:16,385 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 -> c24ad121bcc9573550d02da9627a07166858762ae4177dec26b10c884148a83b [2025-03-17 19:21:16,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:21:16,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:21:16,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:21:16,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:21:16,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:21:16,645 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_test4-3.i [2025-03-17 19:21:17,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f501f5c/8a3a8458b60e45e0a9e73efdc91f380c/FLAG0f63b75fc [2025-03-17 19:21:18,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:21:18,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-3.i [2025-03-17 19:21:18,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f501f5c/8a3a8458b60e45e0a9e73efdc91f380c/FLAG0f63b75fc [2025-03-17 19:21:18,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f501f5c/8a3a8458b60e45e0a9e73efdc91f380c [2025-03-17 19:21:18,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:21:18,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:21:18,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:21:18,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:21:18,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:21:18,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add3508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18, skipping insertion in model container [2025-03-17 19:21:18,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:21:18,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:21:18,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:21:18,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:21:18,724 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:21:18,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18 WrapperNode [2025-03-17 19:21:18,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:21:18,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:21:18,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:21:18,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:21:18,729 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:21:18" (1/1) ... [2025-03-17 19:21:18,756 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:21:18" (1/1) ... [2025-03-17 19:21:18,801 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-03-17 19:21:18,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:21:18,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:21:18,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:21:18,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:21:18,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,946 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-03-17 19:21:18,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:18,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:19,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:21:19,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:21:19,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:21:19,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:21:19,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (1/1) ... [2025-03-17 19:21:19,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:21:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:19,034 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:21:19,036 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:21:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:21:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:21:19,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:21:19,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:21:19,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:21:19,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:21:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:21:19,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:21:19,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:21:19,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:21:20,484 INFO L? ?]: Removed 431 outVars from TransFormulas that were not future-live. [2025-03-17 19:21:20,485 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:21:20,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:21:20,532 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 19:21:20,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:21:20 BoogieIcfgContainer [2025-03-17 19:21:20,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:21:20,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:21:20,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:21:20,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:21:20,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:21:18" (1/3) ... [2025-03-17 19:21:20,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c4acef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:21:20, skipping insertion in model container [2025-03-17 19:21:20,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:21:18" (2/3) ... [2025-03-17 19:21:20,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c4acef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:21:20, skipping insertion in model container [2025-03-17 19:21:20,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:21:20" (3/3) ... [2025-03-17 19:21:20,540 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-3.i [2025-03-17 19:21:20,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:21:20,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test4-3.i that has 4 procedures, 489 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-03-17 19:21:20,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:21:20,623 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;@2e01c95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:21:20,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:21:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 485 states, 460 states have (on average 1.6282608695652174) internal successors, (749), 476 states have internal predecessors, (749), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:21:20,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:20,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:21:20,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 26061128, now seen corresponding path program 1 times [2025-03-17 19:21:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850794602] [2025-03-17 19:21:20,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:20,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:21:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:21:20,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:20,777 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:21:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850794602] [2025-03-17 19:21:20,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850794602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:20,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:20,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170235744] [2025-03-17 19:21:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:20,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:20,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:20,796 INFO L87 Difference]: Start difference. First operand has 485 states, 460 states have (on average 1.6282608695652174) internal successors, (749), 476 states have internal predecessors, (749), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:21,017 INFO L93 Difference]: Finished difference Result 1347 states and 2188 transitions. [2025-03-17 19:21:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 19:21:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:21,032 INFO L225 Difference]: With dead ends: 1347 [2025-03-17 19:21:21,032 INFO L226 Difference]: Without dead ends: 800 [2025-03-17 19:21:21,036 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:21:21,039 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 541 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:21,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1375 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-17 19:21:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 421. [2025-03-17 19:21:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.464824120603015) internal successors, (583), 412 states have internal predecessors, (583), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2025-03-17 19:21:21,094 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 4 [2025-03-17 19:21:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:21,095 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2025-03-17 19:21:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2025-03-17 19:21:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:21:21,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:21,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:21:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:21:21,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -92351107, now seen corresponding path program 1 times [2025-03-17 19:21:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689672470] [2025-03-17 19:21:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:21,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:21:21,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:21:21,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:21,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:21:21,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617525684] [2025-03-17 19:21:21,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:21,131 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:21:21,133 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:21:21,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:21:21,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:21:21,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:21,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:21,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:21:21,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:21,292 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:21:21,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:21,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689672470] [2025-03-17 19:21:21,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:21:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617525684] [2025-03-17 19:21:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617525684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:21:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439145413] [2025-03-17 19:21:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:21,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:21,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:21,295 INFO L87 Difference]: Start difference. First operand 421 states and 615 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:21,434 INFO L93 Difference]: Finished difference Result 801 states and 1169 transitions. [2025-03-17 19:21:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:21:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:21,437 INFO L225 Difference]: With dead ends: 801 [2025-03-17 19:21:21,438 INFO L226 Difference]: Without dead ends: 800 [2025-03-17 19:21:21,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:21:21,439 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 537 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:21,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1174 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-17 19:21:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 425. [2025-03-17 19:21:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.4601990049751243) internal successors, (587), 416 states have internal predecessors, (587), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 619 transitions. [2025-03-17 19:21:21,465 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 619 transitions. Word has length 6 [2025-03-17 19:21:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 619 transitions. [2025-03-17 19:21:21,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 619 transitions. [2025-03-17 19:21:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:21:21,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:21,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:21,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:21:21,672 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:21:21,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash -343921098, now seen corresponding path program 1 times [2025-03-17 19:21:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901959277] [2025-03-17 19:21:21,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:21,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:21:21,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:21:21,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:21,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:22,226 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:21:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901959277] [2025-03-17 19:21:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901959277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:21:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574675585] [2025-03-17 19:21:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:21:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:22,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:21:22,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:21:22,228 INFO L87 Difference]: Start difference. First operand 425 states and 619 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:22,382 INFO L93 Difference]: Finished difference Result 847 states and 1235 transitions. [2025-03-17 19:21:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-17 19:21:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:22,385 INFO L225 Difference]: With dead ends: 847 [2025-03-17 19:21:22,385 INFO L226 Difference]: Without dead ends: 428 [2025-03-17 19:21:22,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:21:22,387 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 108 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:22,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1545 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-17 19:21:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-03-17 19:21:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.4427860696517414) internal successors, (580), 416 states have internal predecessors, (580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 612 transitions. [2025-03-17 19:21:22,401 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 612 transitions. Word has length 146 [2025-03-17 19:21:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:22,401 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 612 transitions. [2025-03-17 19:21:22,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 612 transitions. [2025-03-17 19:21:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:21:22,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:22,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:22,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:21:22,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:22,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1367759228, now seen corresponding path program 1 times [2025-03-17 19:21:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:22,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400461990] [2025-03-17 19:21:22,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:22,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:21:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:21:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:22,623 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:21:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400461990] [2025-03-17 19:21:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400461990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:22,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:22,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:21:22,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784396180] [2025-03-17 19:21:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:22,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:22,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:22,624 INFO L87 Difference]: Start difference. First operand 425 states and 612 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:22,735 INFO L93 Difference]: Finished difference Result 969 states and 1403 transitions. [2025-03-17 19:21:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:22,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-17 19:21:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:22,739 INFO L225 Difference]: With dead ends: 969 [2025-03-17 19:21:22,739 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 19:21:22,740 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:21:22,740 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 134 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:22,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1117 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 19:21:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-17 19:21:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.4497153700189753) internal successors, (764), 541 states have internal predecessors, (764), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 796 transitions. [2025-03-17 19:21:22,756 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 796 transitions. Word has length 146 [2025-03-17 19:21:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 796 transitions. [2025-03-17 19:21:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:21:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 796 transitions. [2025-03-17 19:21:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:21:22,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:22,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:21:22,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 316170086, now seen corresponding path program 1 times [2025-03-17 19:21:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859658086] [2025-03-17 19:21:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:22,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:21:22,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:21:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:23,061 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:21:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859658086] [2025-03-17 19:21:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859658086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:21:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488403154] [2025-03-17 19:21:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:23,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:23,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:23,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:23,066 INFO L87 Difference]: Start difference. First operand 550 states and 796 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:23,194 INFO L93 Difference]: Finished difference Result 972 states and 1405 transitions. [2025-03-17 19:21:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 161 [2025-03-17 19:21:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:23,197 INFO L225 Difference]: With dead ends: 972 [2025-03-17 19:21:23,198 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 19:21:23,199 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:21:23,199 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 105 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:23,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1524 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 19:21:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2025-03-17 19:21:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.4364326375711576) internal successors, (757), 541 states have internal predecessors, (757), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 789 transitions. [2025-03-17 19:21:23,216 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 789 transitions. Word has length 161 [2025-03-17 19:21:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 789 transitions. [2025-03-17 19:21:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 789 transitions. [2025-03-17 19:21:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:21:23,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:23,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:23,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:21:23,218 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:21:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1069773633, now seen corresponding path program 1 times [2025-03-17 19:21:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399384736] [2025-03-17 19:21:23,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:23,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:21:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:21:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:23,429 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:21:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399384736] [2025-03-17 19:21:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399384736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690241149] [2025-03-17 19:21:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:23,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:23,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:23,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:23,430 INFO L87 Difference]: Start difference. First operand 550 states and 789 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:23,524 INFO L93 Difference]: Finished difference Result 975 states and 1397 transitions. [2025-03-17 19:21:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 161 [2025-03-17 19:21:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:23,528 INFO L225 Difference]: With dead ends: 975 [2025-03-17 19:21:23,528 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 19:21:23,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:23,531 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:23,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1078 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 19:21:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-17 19:21:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 533 states have (on average 1.4315196998123827) internal successors, (763), 547 states have internal predecessors, (763), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:21:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2025-03-17 19:21:23,546 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 161 [2025-03-17 19:21:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2025-03-17 19:21:23,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2025-03-17 19:21:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:21:23,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:23,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:23,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:21:23,549 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:21:23,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -829233504, now seen corresponding path program 1 times [2025-03-17 19:21:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779144960] [2025-03-17 19:21:23,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:21:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:21:23,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:23,765 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:21:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779144960] [2025-03-17 19:21:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779144960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442809992] [2025-03-17 19:21:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:21:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:23,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:21:23,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:23,768 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:23,890 INFO L93 Difference]: Finished difference Result 1172 states and 1671 transitions. [2025-03-17 19:21:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:21:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 161 [2025-03-17 19:21:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:23,893 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 19:21:23,893 INFO L226 Difference]: Without dead ends: 747 [2025-03-17 19:21:23,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:21:23,894 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 318 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:23,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1102 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-17 19:21:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2025-03-17 19:21:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4244105409153953) internal successors, (1027), 735 states have internal predecessors, (1027), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 19:21:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1065 transitions. [2025-03-17 19:21:23,913 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1065 transitions. Word has length 161 [2025-03-17 19:21:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:23,914 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1065 transitions. [2025-03-17 19:21:23,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:21:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1065 transitions. [2025-03-17 19:21:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 19:21:23,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:23,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:23,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:21:23,917 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:21:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1651988407, now seen corresponding path program 1 times [2025-03-17 19:21:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338283157] [2025-03-17 19:21:23,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:23,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 19:21:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 19:21:24,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:24,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338283157] [2025-03-17 19:21:24,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338283157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401436926] [2025-03-17 19:21:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:24,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,156 INFO L87 Difference]: Start difference. First operand 747 states and 1065 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:24,244 INFO L93 Difference]: Finished difference Result 747 states and 1065 transitions. [2025-03-17 19:21:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:24,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 176 [2025-03-17 19:21:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:24,248 INFO L225 Difference]: With dead ends: 747 [2025-03-17 19:21:24,248 INFO L226 Difference]: Without dead ends: 746 [2025-03-17 19:21:24,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,249 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 375 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:24,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-17 19:21:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2025-03-17 19:21:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 721 states have (on average 1.4230235783633842) internal successors, (1026), 734 states have internal predecessors, (1026), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 19:21:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1064 transitions. [2025-03-17 19:21:24,267 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1064 transitions. Word has length 176 [2025-03-17 19:21:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:24,268 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1064 transitions. [2025-03-17 19:21:24,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1064 transitions. [2025-03-17 19:21:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 19:21:24,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:24,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:24,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:21:24,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 327967080, now seen corresponding path program 1 times [2025-03-17 19:21:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026717476] [2025-03-17 19:21:24,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:24,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 19:21:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 19:21:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:24,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026717476] [2025-03-17 19:21:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026717476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266350120] [2025-03-17 19:21:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:24,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,559 INFO L87 Difference]: Start difference. First operand 746 states and 1064 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:24,694 INFO L93 Difference]: Finished difference Result 810 states and 1148 transitions. [2025-03-17 19:21:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:24,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-17 19:21:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:24,697 INFO L225 Difference]: With dead ends: 810 [2025-03-17 19:21:24,697 INFO L226 Difference]: Without dead ends: 809 [2025-03-17 19:21:24,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,698 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 368 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:24,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1717 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-17 19:21:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-03-17 19:21:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 781 states have (on average 1.412291933418694) internal successors, (1103), 794 states have internal predecessors, (1103), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1147 transitions. [2025-03-17 19:21:24,714 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1147 transitions. Word has length 177 [2025-03-17 19:21:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:24,714 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1147 transitions. [2025-03-17 19:21:24,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1147 transitions. [2025-03-17 19:21:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 19:21:24,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:24,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:21:24,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -583175162, now seen corresponding path program 1 times [2025-03-17 19:21:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135877109] [2025-03-17 19:21:24,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:24,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 19:21:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 19:21:24,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:24,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 19:21:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135877109] [2025-03-17 19:21:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135877109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:21:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595512717] [2025-03-17 19:21:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:24,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:24,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:24,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:21:24,971 INFO L87 Difference]: Start difference. First operand 809 states and 1147 transitions. Second operand has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:25,069 INFO L93 Difference]: Finished difference Result 833 states and 1189 transitions. [2025-03-17 19:21:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:21:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 180 [2025-03-17 19:21:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:25,074 INFO L225 Difference]: With dead ends: 833 [2025-03-17 19:21:25,074 INFO L226 Difference]: Without dead ends: 831 [2025-03-17 19:21:25,074 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:21:25,074 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 409 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:25,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1129 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-17 19:21:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 812. [2025-03-17 19:21:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 784 states have (on average 1.4107142857142858) internal successors, (1106), 797 states have internal predecessors, (1106), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1150 transitions. [2025-03-17 19:21:25,112 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1150 transitions. Word has length 180 [2025-03-17 19:21:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1150 transitions. [2025-03-17 19:21:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1150 transitions. [2025-03-17 19:21:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 19:21:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:25,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:25,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:21:25,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:25,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1452873541, now seen corresponding path program 1 times [2025-03-17 19:21:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:25,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742510305] [2025-03-17 19:21:25,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:21:25,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:21:25,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:25,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742510305] [2025-03-17 19:21:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742510305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007825986] [2025-03-17 19:21:25,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:25,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:25,767 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:21:25,768 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:21:26,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:21:26,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:21:26,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:26,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:26,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:21:26,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:26,249 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:21:26,267 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 21 treesize of output 20 [2025-03-17 19:21:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:26,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007825986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-03-17 19:21:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719520758] [2025-03-17 19:21:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:21:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:26,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:21:26,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:21:26,978 INFO L87 Difference]: Start difference. First operand 812 states and 1150 transitions. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:28,468 INFO L93 Difference]: Finished difference Result 1588 states and 2243 transitions. [2025-03-17 19:21:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:21:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-17 19:21:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:28,472 INFO L225 Difference]: With dead ends: 1588 [2025-03-17 19:21:28,472 INFO L226 Difference]: Without dead ends: 860 [2025-03-17 19:21:28,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:21:28,473 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 793 mSDsluCounter, 2721 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:28,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 3271 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 19:21:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-17 19:21:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 837. [2025-03-17 19:21:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 809 states have (on average 1.4042027194066748) internal successors, (1136), 822 states have internal predecessors, (1136), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1180 transitions. [2025-03-17 19:21:28,496 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1180 transitions. Word has length 182 [2025-03-17 19:21:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:28,496 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1180 transitions. [2025-03-17 19:21:28,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1180 transitions. [2025-03-17 19:21:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 19:21:28,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:28,498 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:28,508 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:21:28,702 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,SelfDestructingSolverStorable10 [2025-03-17 19:21:28,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1710326265, now seen corresponding path program 1 times [2025-03-17 19:21:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389458582] [2025-03-17 19:21:28,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:28,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:21:29,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:21:29,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:29,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389458582] [2025-03-17 19:21:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389458582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197763264] [2025-03-17 19:21:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:29,338 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:21:29,339 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:21:29,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:21:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:21:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:29,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:21:29,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:29,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197763264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:29,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:21:29,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455552075] [2025-03-17 19:21:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:29,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:21:29,866 INFO L87 Difference]: Start difference. First operand 837 states and 1180 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:30,080 INFO L93 Difference]: Finished difference Result 1608 states and 2270 transitions. [2025-03-17 19:21:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-17 19:21:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:30,083 INFO L225 Difference]: With dead ends: 1608 [2025-03-17 19:21:30,083 INFO L226 Difference]: Without dead ends: 880 [2025-03-17 19:21:30,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:21:30,085 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 17 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:30,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1475 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:21:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-17 19:21:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 864. [2025-03-17 19:21:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 836 states have (on average 1.3983253588516746) internal successors, (1169), 849 states have internal predecessors, (1169), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1213 transitions. [2025-03-17 19:21:30,105 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1213 transitions. Word has length 183 [2025-03-17 19:21:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1213 transitions. [2025-03-17 19:21:30,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1213 transitions. [2025-03-17 19:21:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 19:21:30,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:30,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:30,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:30,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -862107048, now seen corresponding path program 1 times [2025-03-17 19:21:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901383216] [2025-03-17 19:21:30,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:30,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 19:21:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 19:21:30,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:30,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901383216] [2025-03-17 19:21:30,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901383216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:30,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:21:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048308766] [2025-03-17 19:21:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:30,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:21:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:30,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:21:30,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:21:30,630 INFO L87 Difference]: Start difference. First operand 864 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:31,058 INFO L93 Difference]: Finished difference Result 1627 states and 2289 transitions. [2025-03-17 19:21:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:21:31,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-17 19:21:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:31,061 INFO L225 Difference]: With dead ends: 1627 [2025-03-17 19:21:31,061 INFO L226 Difference]: Without dead ends: 876 [2025-03-17 19:21:31,062 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:21:31,062 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 8 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:31,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2258 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:21:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-17 19:21:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 872. [2025-03-17 19:21:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 844 states have (on average 1.396919431279621) internal successors, (1179), 857 states have internal predecessors, (1179), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1223 transitions. [2025-03-17 19:21:31,081 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1223 transitions. Word has length 184 [2025-03-17 19:21:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:31,081 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1223 transitions. [2025-03-17 19:21:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1223 transitions. [2025-03-17 19:21:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:21:31,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:31,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:31,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:21:31,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:31,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -746587421, now seen corresponding path program 1 times [2025-03-17 19:21:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973408000] [2025-03-17 19:21:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:31,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:21:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:21:31,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:31,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973408000] [2025-03-17 19:21:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973408000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:31,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:21:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262189713] [2025-03-17 19:21:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:21:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:31,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:21:31,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:21:31,420 INFO L87 Difference]: Start difference. First operand 872 states and 1223 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:31,912 INFO L93 Difference]: Finished difference Result 1642 states and 2309 transitions. [2025-03-17 19:21:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:21:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:21:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:31,916 INFO L225 Difference]: With dead ends: 1642 [2025-03-17 19:21:31,916 INFO L226 Difference]: Without dead ends: 894 [2025-03-17 19:21:31,917 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:21:31,917 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 12 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:31,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2681 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:21:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-17 19:21:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2025-03-17 19:21:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 860 states have (on average 1.3965116279069767) internal successors, (1201), 873 states have internal predecessors, (1201), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1245 transitions. [2025-03-17 19:21:31,940 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1245 transitions. Word has length 185 [2025-03-17 19:21:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:31,940 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1245 transitions. [2025-03-17 19:21:31,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1245 transitions. [2025-03-17 19:21:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:21:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:31,942 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:21:31,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 870146700, now seen corresponding path program 1 times [2025-03-17 19:21:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575003236] [2025-03-17 19:21:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:31,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:21:32,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:21:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575003236] [2025-03-17 19:21:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575003236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548903194] [2025-03-17 19:21:32,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:32,333 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:21:32,335 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:21:32,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:21:32,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:21:32,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:32,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:32,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:21:32,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:33,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548903194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:33,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:33,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:21:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213275737] [2025-03-17 19:21:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:33,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:21:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:33,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:21:33,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:21:33,078 INFO L87 Difference]: Start difference. First operand 888 states and 1245 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:33,653 INFO L93 Difference]: Finished difference Result 1658 states and 2330 transitions. [2025-03-17 19:21:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:21:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:21:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:33,656 INFO L225 Difference]: With dead ends: 1658 [2025-03-17 19:21:33,656 INFO L226 Difference]: Without dead ends: 902 [2025-03-17 19:21:33,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 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:21:33,657 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 12 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:33,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2687 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:21:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-17 19:21:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 888. [2025-03-17 19:21:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 860 states have (on average 1.3965116279069767) internal successors, (1201), 873 states have internal predecessors, (1201), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1245 transitions. [2025-03-17 19:21:33,674 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1245 transitions. Word has length 185 [2025-03-17 19:21:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:33,674 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1245 transitions. [2025-03-17 19:21:33,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1245 transitions. [2025-03-17 19:21:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 19:21:33,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:33,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:33,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:33,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:21:33,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 121497809, now seen corresponding path program 1 times [2025-03-17 19:21:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405531886] [2025-03-17 19:21:33,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:33,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:21:33,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:21:33,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:33,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405531886] [2025-03-17 19:21:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405531886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:34,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:21:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985089748] [2025-03-17 19:21:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:21:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:34,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:21:34,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:21:34,219 INFO L87 Difference]: Start difference. First operand 888 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:34,814 INFO L93 Difference]: Finished difference Result 1665 states and 2336 transitions. [2025-03-17 19:21:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:21:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-17 19:21:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:34,818 INFO L225 Difference]: With dead ends: 1665 [2025-03-17 19:21:34,818 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 19:21:34,820 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:21:34,821 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:34,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3648 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:21:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 19:21:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 902. [2025-03-17 19:21:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 874 states have (on average 1.394736842105263) internal successors, (1219), 887 states have internal predecessors, (1219), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1263 transitions. [2025-03-17 19:21:34,843 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1263 transitions. Word has length 186 [2025-03-17 19:21:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1263 transitions. [2025-03-17 19:21:34,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1263 transitions. [2025-03-17 19:21:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 19:21:34,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:34,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:34,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:21:34,845 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1299351992, now seen corresponding path program 1 times [2025-03-17 19:21:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:34,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407604994] [2025-03-17 19:21:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:34,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:21:35,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:21:35,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:35,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407604994] [2025-03-17 19:21:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407604994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522315125] [2025-03-17 19:21:35,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:35,196 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:21:35,198 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:21:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:21:35,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:21:35,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:35,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:35,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:21:35,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:35,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522315125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:35,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 19:21:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16864197] [2025-03-17 19:21:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:21:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:35,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:21:35,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:35,808 INFO L87 Difference]: Start difference. First operand 902 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:36,671 INFO L93 Difference]: Finished difference Result 1686 states and 2363 transitions. [2025-03-17 19:21:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:21:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-17 19:21:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:36,674 INFO L225 Difference]: With dead ends: 1686 [2025-03-17 19:21:36,674 INFO L226 Difference]: Without dead ends: 928 [2025-03-17 19:21:36,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:36,675 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 17 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:36,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2750 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:21:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-03-17 19:21:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 912. [2025-03-17 19:21:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 884 states have (on average 1.3925339366515836) internal successors, (1231), 897 states have internal predecessors, (1231), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1275 transitions. [2025-03-17 19:21:36,691 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1275 transitions. Word has length 186 [2025-03-17 19:21:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:36,691 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1275 transitions. [2025-03-17 19:21:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1275 transitions. [2025-03-17 19:21:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:21:36,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:36,693 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:36,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 19:21:36,895 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,SelfDestructingSolverStorable16 [2025-03-17 19:21:36,895 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -657803268, now seen corresponding path program 1 times [2025-03-17 19:21:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241958630] [2025-03-17 19:21:36,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:36,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:36,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:36,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:36,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241958630] [2025-03-17 19:21:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241958630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:37,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:21:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 19:21:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435458685] [2025-03-17 19:21:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:21:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:21:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:37,372 INFO L87 Difference]: Start difference. First operand 912 states and 1275 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:38,032 INFO L93 Difference]: Finished difference Result 1698 states and 2379 transitions. [2025-03-17 19:21:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:21:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:21:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:38,035 INFO L225 Difference]: With dead ends: 1698 [2025-03-17 19:21:38,035 INFO L226 Difference]: Without dead ends: 930 [2025-03-17 19:21:38,036 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:21:38,036 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 23 mSDsluCounter, 3086 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:38,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3630 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:21:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-17 19:21:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 918. [2025-03-17 19:21:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 890 states have (on average 1.3898876404494382) internal successors, (1237), 903 states have internal predecessors, (1237), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1281 transitions. [2025-03-17 19:21:38,052 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1281 transitions. Word has length 187 [2025-03-17 19:21:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1281 transitions. [2025-03-17 19:21:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1281 transitions. [2025-03-17 19:21:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:21:38,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:38,053 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:21:38,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 564875849, now seen corresponding path program 1 times [2025-03-17 19:21:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521023628] [2025-03-17 19:21:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:38,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:38,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:38,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:38,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521023628] [2025-03-17 19:21:38,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521023628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127574968] [2025-03-17 19:21:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:38,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:38,556 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:21:38,558 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:21:38,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:39,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:39,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:39,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:39,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:21:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:39,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127574968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:39,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:21:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101844181] [2025-03-17 19:21:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:21:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:39,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:21:39,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:21:39,254 INFO L87 Difference]: Start difference. First operand 918 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:39,853 INFO L93 Difference]: Finished difference Result 1703 states and 2384 transitions. [2025-03-17 19:21:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:21:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:21:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:39,857 INFO L225 Difference]: With dead ends: 1703 [2025-03-17 19:21:39,857 INFO L226 Difference]: Without dead ends: 932 [2025-03-17 19:21:39,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 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:21:39,858 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 10 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:39,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2687 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:21:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-17 19:21:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2025-03-17 19:21:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 892 states have (on average 1.391255605381166) internal successors, (1241), 905 states have internal predecessors, (1241), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1285 transitions. [2025-03-17 19:21:39,884 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1285 transitions. Word has length 187 [2025-03-17 19:21:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:39,884 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1285 transitions. [2025-03-17 19:21:39,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1285 transitions. [2025-03-17 19:21:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:21:39,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:39,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:39,898 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:21:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:40,088 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:40,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1629961211, now seen corresponding path program 1 times [2025-03-17 19:21:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015596222] [2025-03-17 19:21:40,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:40,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:40,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015596222] [2025-03-17 19:21:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015596222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:40,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906033830] [2025-03-17 19:21:40,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:40,599 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:21:40,600 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:21:40,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:41,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:41,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:41,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:21:41,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:41,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906033830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 19:21:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801306335] [2025-03-17 19:21:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:21:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:21:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:41,290 INFO L87 Difference]: Start difference. First operand 920 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:41,753 INFO L93 Difference]: Finished difference Result 1711 states and 2392 transitions. [2025-03-17 19:21:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:21:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:21:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:41,757 INFO L225 Difference]: With dead ends: 1711 [2025-03-17 19:21:41,757 INFO L226 Difference]: Without dead ends: 944 [2025-03-17 19:21:41,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:21:41,758 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 16 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:41,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3199 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:21:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-17 19:21:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 934. [2025-03-17 19:21:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 906 states have (on average 1.3896247240618103) internal successors, (1259), 919 states have internal predecessors, (1259), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1303 transitions. [2025-03-17 19:21:41,784 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1303 transitions. Word has length 187 [2025-03-17 19:21:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:41,785 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1303 transitions. [2025-03-17 19:21:41,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1303 transitions. [2025-03-17 19:21:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:21:41,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:41,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:41,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:41,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:41,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:41,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1754474139, now seen corresponding path program 1 times [2025-03-17 19:21:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:41,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656156530] [2025-03-17 19:21:41,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:42,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:42,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:42,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656156530] [2025-03-17 19:21:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656156530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728739782] [2025-03-17 19:21:42,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:42,533 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:21:42,535 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:21:42,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:21:43,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:21:43,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:43,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:43,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:21:43,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:21:43,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728739782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-17 19:21:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017588100] [2025-03-17 19:21:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:43,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:21:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:43,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:21:43,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:21:43,670 INFO L87 Difference]: Start difference. First operand 934 states and 1303 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:44,988 INFO L93 Difference]: Finished difference Result 1735 states and 2428 transitions. [2025-03-17 19:21:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:21:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:21:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:44,991 INFO L225 Difference]: With dead ends: 1735 [2025-03-17 19:21:44,991 INFO L226 Difference]: Without dead ends: 956 [2025-03-17 19:21:44,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:21:44,992 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 17 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3969 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:44,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3969 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 19:21:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-17 19:21:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 948. [2025-03-17 19:21:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 920 states have (on average 1.3880434782608695) internal successors, (1277), 933 states have internal predecessors, (1277), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:21:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1321 transitions. [2025-03-17 19:21:45,035 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1321 transitions. Word has length 187 [2025-03-17 19:21:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:45,035 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1321 transitions. [2025-03-17 19:21:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:21:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1321 transitions. [2025-03-17 19:21:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 19:21:45,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:45,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:45,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 19:21:45,237 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:45,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 94292698, now seen corresponding path program 1 times [2025-03-17 19:21:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453789938] [2025-03-17 19:21:45,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:45,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 19:21:45,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 19:21:45,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:45,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:21:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453789938] [2025-03-17 19:21:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453789938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232857770] [2025-03-17 19:21:45,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:45,792 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:21:45,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:21:46,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 19:21:46,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 19:21:46,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:46,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:46,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:21:46,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:21:46,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:21:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232857770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:21:46,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:21:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 19:21:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685413442] [2025-03-17 19:21:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:21:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:21:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:21:46,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:21:46,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:21:46,637 INFO L87 Difference]: Start difference. First operand 948 states and 1321 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:21:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:21:46,720 INFO L93 Difference]: Finished difference Result 1697 states and 2378 transitions. [2025-03-17 19:21:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:21:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-03-17 19:21:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:21:46,723 INFO L225 Difference]: With dead ends: 1697 [2025-03-17 19:21:46,723 INFO L226 Difference]: Without dead ends: 951 [2025-03-17 19:21:46,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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:21:46,726 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:21:46,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1646 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:21:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-17 19:21:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2025-03-17 19:21:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 922 states have (on average 1.3882863340563991) internal successors, (1280), 936 states have internal predecessors, (1280), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2025-03-17 19:21:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1328 transitions. [2025-03-17 19:21:46,744 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1328 transitions. Word has length 188 [2025-03-17 19:21:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:21:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1328 transitions. [2025-03-17 19:21:46,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:21:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1328 transitions. [2025-03-17 19:21:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 19:21:46,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:21:46,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:21:46,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:21:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:46,947 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:21:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:21:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 307425250, now seen corresponding path program 1 times [2025-03-17 19:21:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:21:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565938742] [2025-03-17 19:21:46,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:21:46,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:21:47,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:21:47,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:47,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:21:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:21:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565938742] [2025-03-17 19:21:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565938742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:21:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60872581] [2025-03-17 19:21:47,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:21:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:21:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:21:47,610 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:21:47,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:21:48,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:21:48,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:21:48,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:21:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:21:48,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 185 conjuncts are in the unsatisfiable core [2025-03-17 19:21:48,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:21:48,474 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:21:48,613 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 15 treesize of output 1 [2025-03-17 19:21:48,615 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:21:48,630 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-17 19:21:48,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-17 19:21:48,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 19:21:48,673 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 7 treesize of output 3 [2025-03-17 19:21:48,762 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:21:48,762 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 50 treesize of output 45 [2025-03-17 19:21:48,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:21:51,990 INFO L224 Elim1Store]: Index analysis took 168 ms