./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:59:47,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:59:47,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 05:59:47,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:59:47,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:59:47,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:59:47,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:59:47,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:59:47,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:59:47,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:59:47,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:59:47,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:59:47,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:59:47,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:59:47,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:59:47,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:59:47,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:59:47,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:59:47,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:59:47,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:59:47,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:59:47,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:59:47,469 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-09 05:59:47,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:59:47,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:59:47,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:59:47,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:59:47,680 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:59:47,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-09 05:59:48,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7dcb9a71/9cbbe497bdad43e1b2c5872778486784/FLAG78f33bace [2025-03-09 05:59:49,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:59:49,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-09 05:59:49,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7dcb9a71/9cbbe497bdad43e1b2c5872778486784/FLAG78f33bace [2025-03-09 05:59:49,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7dcb9a71/9cbbe497bdad43e1b2c5872778486784 [2025-03-09 05:59:49,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:59:49,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:59:49,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:59:49,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:59:49,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:59:49,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b0c1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49, skipping insertion in model container [2025-03-09 05:59:49,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:59:49,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:59:49,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:59:49,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:59:49,848 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:59:49,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49 WrapperNode [2025-03-09 05:59:49,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:59:49,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:59:49,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:59:49,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:59:49,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,909 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-09 05:59:49,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:59:49,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:59:49,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:59:49,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:59:49,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,962 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-09 05:59:49,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:59:49,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:59:49,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:59:49,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:59:49,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (1/1) ... [2025-03-09 05:59:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:59:50,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:50,020 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-09 05:59:50,023 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-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 05:59:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 05:59:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:59:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:59:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:59:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:59:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 05:59:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 05:59:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:59:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:59:50,180 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:59:50,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:59:50,949 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-03-09 05:59:50,949 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:59:50,985 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:59:50,985 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 05:59:50,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:59:50 BoogieIcfgContainer [2025-03-09 05:59:50,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:59:50,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:59:50,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:59:50,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:59:50,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:59:49" (1/3) ... [2025-03-09 05:59:50,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615967ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:59:50, skipping insertion in model container [2025-03-09 05:59:50,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:59:49" (2/3) ... [2025-03-09 05:59:50,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615967ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:59:50, skipping insertion in model container [2025-03-09 05:59:50,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:59:50" (3/3) ... [2025-03-09 05:59:50,993 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2025-03-09 05:59:51,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:59:51,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 3 procedures, 221 locations, 1 initial locations, 19 loop locations, and 6 error locations. [2025-03-09 05:59:51,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:59:51,066 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;@7fc80676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:59:51,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 05:59:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 206 states have (on average 1.6116504854368932) internal successors, (332), 212 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:59:51,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:51,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:59:51,076 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-09 05:59:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 373720117, now seen corresponding path program 1 times [2025-03-09 05:59:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207576794] [2025-03-09 05:59:51,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:51,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:59:51,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:59:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:51,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-09 05:59:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207576794] [2025-03-09 05:59:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207576794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:51,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:51,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704629700] [2025-03-09 05:59:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:51,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:59:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:51,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:59:51,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:59:51,252 INFO L87 Difference]: Start difference. First operand has 217 states, 206 states have (on average 1.6116504854368932) internal successors, (332), 212 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:59:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:51,397 INFO L93 Difference]: Finished difference Result 626 states and 987 transitions. [2025-03-09 05:59:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:59:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 05:59:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:51,409 INFO L225 Difference]: With dead ends: 626 [2025-03-09 05:59:51,411 INFO L226 Difference]: Without dead ends: 405 [2025-03-09 05:59:51,415 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-09 05:59:51,418 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 275 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:51,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 554 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-09 05:59:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 211. [2025-03-09 05:59:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 201 states have (on average 1.4577114427860696) internal successors, (293), 206 states have internal predecessors, (293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2025-03-09 05:59:51,475 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 5 [2025-03-09 05:59:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:51,476 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2025-03-09 05:59:51,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:59:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2025-03-09 05:59:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 05:59:51,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:51,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 05:59:51,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:59:51,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:51,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1289173282, now seen corresponding path program 1 times [2025-03-09 05:59:51,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:51,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847062679] [2025-03-09 05:59:51,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:51,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 05:59:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 05:59:51,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:51,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:51,667 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-09 05:59:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847062679] [2025-03-09 05:59:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847062679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:51,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:51,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:51,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35903112] [2025-03-09 05:59:51,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:51,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:59:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:51,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:59:51,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:51,674 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 05:59:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:51,753 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2025-03-09 05:59:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:59:51,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 05:59:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:51,755 INFO L225 Difference]: With dead ends: 216 [2025-03-09 05:59:51,755 INFO L226 Difference]: Without dead ends: 215 [2025-03-09 05:59:51,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:51,756 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:51,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 806 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-09 05:59:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2025-03-09 05:59:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-03-09 05:59:51,769 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 6 [2025-03-09 05:59:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:51,769 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-03-09 05:59:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 05:59:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-03-09 05:59:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:59:51,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:51,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:59:51,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1309665755, now seen corresponding path program 1 times [2025-03-09 05:59:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88779187] [2025-03-09 05:59:51,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:51,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:59:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:59:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:51,891 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-09 05:59:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88779187] [2025-03-09 05:59:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88779187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:51,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144114196] [2025-03-09 05:59:51,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:51,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:59:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:51,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:59:51,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:51,893 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:59:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:51,958 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2025-03-09 05:59:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:59:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:59:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:51,960 INFO L225 Difference]: With dead ends: 216 [2025-03-09 05:59:51,960 INFO L226 Difference]: Without dead ends: 215 [2025-03-09 05:59:51,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:51,961 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:51,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-09 05:59:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-09 05:59:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.448780487804878) internal successors, (297), 210 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-03-09 05:59:51,979 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 7 [2025-03-09 05:59:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-03-09 05:59:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:59:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-03-09 05:59:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 05:59:51,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:51,982 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] [2025-03-09 05:59:51,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:59:51,982 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-09 05:59:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 279899245, now seen corresponding path program 1 times [2025-03-09 05:59:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567295045] [2025-03-09 05:59:51,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 05:59:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 05:59:52,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:52,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:52,236 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-09 05:59:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567295045] [2025-03-09 05:59:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567295045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:59:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520547454] [2025-03-09 05:59:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:59:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:52,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:59:52,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:52,238 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-09 05:59:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:52,345 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2025-03-09 05:59:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:59:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-09 05:59:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:52,346 INFO L225 Difference]: With dead ends: 426 [2025-03-09 05:59:52,346 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 05:59:52,347 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-09 05:59:52,348 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 105 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:52,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 663 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 05:59:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-03-09 05:59:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 210 states have internal predecessors, (290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 296 transitions. [2025-03-09 05:59:52,359 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 296 transitions. Word has length 78 [2025-03-09 05:59:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 296 transitions. [2025-03-09 05:59:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-09 05:59:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 296 transitions. [2025-03-09 05:59:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 05:59:52,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:52,364 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] [2025-03-09 05:59:52,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:59:52,364 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-09 05:59:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1407422887, now seen corresponding path program 1 times [2025-03-09 05:59:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929057832] [2025-03-09 05:59:52,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:52,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 05:59:52,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 05:59:52,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:52,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:52,512 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-09 05:59:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929057832] [2025-03-09 05:59:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929057832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792811611] [2025-03-09 05:59:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:52,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:59:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:52,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:59:52,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:59:52,514 INFO L87 Difference]: Start difference. First operand 215 states and 296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-09 05:59:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:52,629 INFO L93 Difference]: Finished difference Result 548 states and 770 transitions. [2025-03-09 05:59:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:59:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-09 05:59:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:52,632 INFO L225 Difference]: With dead ends: 548 [2025-03-09 05:59:52,633 INFO L226 Difference]: Without dead ends: 340 [2025-03-09 05:59:52,634 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-09 05:59:52,635 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 528 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-09 05:59:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-09 05:59:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.4363636363636363) internal successors, (474), 335 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:59:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2025-03-09 05:59:52,652 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 78 [2025-03-09 05:59:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:52,653 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2025-03-09 05:59:52,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-09 05:59:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2025-03-09 05:59:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 05:59:52,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:52,657 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] [2025-03-09 05:59:52,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 05:59:52,657 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-09 05:59:52,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1323163530, now seen corresponding path program 1 times [2025-03-09 05:59:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:52,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757844093] [2025-03-09 05:59:52,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 05:59:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 05:59:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:52,905 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-09 05:59:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757844093] [2025-03-09 05:59:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757844093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406192002] [2025-03-09 05:59:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:59:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:52,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:59:52,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:52,908 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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-09 05:59:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:53,003 INFO L93 Difference]: Finished difference Result 405 states and 565 transitions. [2025-03-09 05:59:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:59:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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 93 [2025-03-09 05:59:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:53,007 INFO L225 Difference]: With dead ends: 405 [2025-03-09 05:59:53,007 INFO L226 Difference]: Without dead ends: 403 [2025-03-09 05:59:53,008 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-09 05:59:53,008 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 185 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:53,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 787 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-09 05:59:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-09 05:59:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 390 states have (on average 1.412820512820513) internal successors, (551), 395 states have internal predecessors, (551), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 05:59:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 563 transitions. [2025-03-09 05:59:53,025 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 563 transitions. Word has length 93 [2025-03-09 05:59:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:53,026 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 563 transitions. [2025-03-09 05:59:53,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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-09 05:59:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 563 transitions. [2025-03-09 05:59:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 05:59:53,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:53,027 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] [2025-03-09 05:59:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:59:53,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -429146937, now seen corresponding path program 1 times [2025-03-09 05:59:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328210439] [2025-03-09 05:59:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:53,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:59:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:59:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:53,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328210439] [2025-03-09 05:59:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328210439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:59:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103424789] [2025-03-09 05:59:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:53,281 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-09 05:59:53,282 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-09 05:59:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:59:53,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:59:53,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:53,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:53,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:59:53,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:53,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:59:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103424789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:59:53,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:59:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 05:59:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441027933] [2025-03-09 05:59:53,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:59:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 05:59:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:53,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 05:59:53,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:59:53,749 INFO L87 Difference]: Start difference. First operand 403 states and 563 transitions. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 05:59:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:53,940 INFO L93 Difference]: Finished difference Result 607 states and 850 transitions. [2025-03-09 05:59:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 05:59:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 97 [2025-03-09 05:59:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:53,945 INFO L225 Difference]: With dead ends: 607 [2025-03-09 05:59:53,946 INFO L226 Difference]: Without dead ends: 601 [2025-03-09 05:59:53,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:59:53,947 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1047 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:53,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1976 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:59:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-09 05:59:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-03-09 05:59:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 583 states have (on average 1.4133790737564322) internal successors, (824), 588 states have internal predecessors, (824), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 05:59:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 842 transitions. [2025-03-09 05:59:53,978 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 842 transitions. Word has length 97 [2025-03-09 05:59:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 842 transitions. [2025-03-09 05:59:53,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 05:59:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 842 transitions. [2025-03-09 05:59:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 05:59:53,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:53,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:53,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:59:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:54,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:54,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash -408248180, now seen corresponding path program 1 times [2025-03-09 05:59:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:54,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818509738] [2025-03-09 05:59:54,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 05:59:54,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 05:59:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818509738] [2025-03-09 05:59:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818509738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:59:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887475521] [2025-03-09 05:59:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:54,649 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-09 05:59:54,649 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-09 05:59:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 05:59:54,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 05:59:54,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:54,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 05:59:54,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:55,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:59:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887475521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:59:55,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:59:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 05:59:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675027248] [2025-03-09 05:59:55,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:59:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:59:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:59:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:59:55,164 INFO L87 Difference]: Start difference. First operand 599 states and 842 transitions. Second operand has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 05:59:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:55,438 INFO L93 Difference]: Finished difference Result 805 states and 1133 transitions. [2025-03-09 05:59:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 05:59:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2025-03-09 05:59:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:55,443 INFO L225 Difference]: With dead ends: 805 [2025-03-09 05:59:55,444 INFO L226 Difference]: Without dead ends: 804 [2025-03-09 05:59:55,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-09 05:59:55,445 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 980 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:55,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2233 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:59:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-09 05:59:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 797. [2025-03-09 05:59:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 778 states have (on average 1.4125964010282777) internal successors, (1099), 783 states have internal predecessors, (1099), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:59:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1123 transitions. [2025-03-09 05:59:55,479 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1123 transitions. Word has length 98 [2025-03-09 05:59:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:55,479 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1123 transitions. [2025-03-09 05:59:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 05:59:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1123 transitions. [2025-03-09 05:59:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-09 05:59:55,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:55,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:55,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:59:55,681 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,SelfDestructingSolverStorable7 [2025-03-09 05:59:55,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:55,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash 229208631, now seen corresponding path program 1 times [2025-03-09 05:59:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:55,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601479767] [2025-03-09 05:59:55,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:55,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 05:59:55,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 05:59:55,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:55,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601479767] [2025-03-09 05:59:56,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601479767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:59:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644611794] [2025-03-09 05:59:56,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:56,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:56,117 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-09 05:59:56,119 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-09 05:59:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 05:59:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 05:59:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:56,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 05:59:56,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:56,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:59:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644611794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:59:56,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:59:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 05:59:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083356056] [2025-03-09 05:59:56,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:59:56,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:59:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:56,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:59:56,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:59:56,599 INFO L87 Difference]: Start difference. First operand 797 states and 1123 transitions. Second operand has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 05:59:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:56,818 INFO L93 Difference]: Finished difference Result 805 states and 1130 transitions. [2025-03-09 05:59:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 05:59:56,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 99 [2025-03-09 05:59:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:56,822 INFO L225 Difference]: With dead ends: 805 [2025-03-09 05:59:56,822 INFO L226 Difference]: Without dead ends: 804 [2025-03-09 05:59:56,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-09 05:59:56,823 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 794 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:56,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2183 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:59:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-09 05:59:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 798. [2025-03-09 05:59:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 779 states have (on average 1.4094993581514763) internal successors, (1098), 784 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:59:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1122 transitions. [2025-03-09 05:59:56,840 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1122 transitions. Word has length 99 [2025-03-09 05:59:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:56,841 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1122 transitions. [2025-03-09 05:59:56,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 05:59:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1122 transitions. [2025-03-09 05:59:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-09 05:59:56,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:56,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:56,852 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-09 05:59:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:57,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1347120469, now seen corresponding path program 1 times [2025-03-09 05:59:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735929680] [2025-03-09 05:59:57,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:57,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-09 05:59:57,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-09 05:59:57,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:57,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:57,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735929680] [2025-03-09 05:59:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735929680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:59:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309636709] [2025-03-09 05:59:57,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:57,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:57,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:57,372 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-09 05:59:57,374 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-09 05:59:57,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-09 05:59:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-09 05:59:57,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:57,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:59:57,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:57,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:59:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309636709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:59:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 05:59:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431500377] [2025-03-09 05:59:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:59:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:57,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:59:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:59:57,866 INFO L87 Difference]: Start difference. First operand 798 states and 1122 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 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-09 05:59:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:57,992 INFO L93 Difference]: Finished difference Result 798 states and 1122 transitions. [2025-03-09 05:59:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:59:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 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 170 [2025-03-09 05:59:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:57,995 INFO L225 Difference]: With dead ends: 798 [2025-03-09 05:59:57,995 INFO L226 Difference]: Without dead ends: 797 [2025-03-09 05:59:57,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:59:57,996 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 379 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:57,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1670 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:59:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-09 05:59:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2025-03-09 05:59:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 779 states have (on average 1.4056482670089858) internal successors, (1095), 783 states have internal predecessors, (1095), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:59:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1119 transitions. [2025-03-09 05:59:58,016 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1119 transitions. Word has length 170 [2025-03-09 05:59:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:58,016 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1119 transitions. [2025-03-09 05:59:58,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 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-09 05:59:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1119 transitions. [2025-03-09 05:59:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-09 05:59:58,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:58,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:58,029 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-09 05:59:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:58,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2116521009, now seen corresponding path program 1 times [2025-03-09 05:59:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332611497] [2025-03-09 05:59:58,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:58,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-09 05:59:58,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-09 05:59:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-09 05:59:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332611497] [2025-03-09 05:59:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332611497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:59:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:59:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:59:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070452261] [2025-03-09 05:59:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:59:58,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:59:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:59:58,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:59:58,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:59:58,524 INFO L87 Difference]: Start difference. First operand 797 states and 1119 transitions. Second operand has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 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-09 05:59:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:59:58,581 INFO L93 Difference]: Finished difference Result 797 states and 1119 transitions. [2025-03-09 05:59:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:59:58,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 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 248 [2025-03-09 05:59:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:59:58,586 INFO L225 Difference]: With dead ends: 797 [2025-03-09 05:59:58,586 INFO L226 Difference]: Without dead ends: 796 [2025-03-09 05:59:58,587 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-09 05:59:58,588 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 194 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:59:58,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 536 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:59:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-09 05:59:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-09 05:59:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 779 states have (on average 1.4030808729139923) internal successors, (1093), 782 states have internal predecessors, (1093), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:59:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1117 transitions. [2025-03-09 05:59:58,614 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1117 transitions. Word has length 248 [2025-03-09 05:59:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:59:58,614 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1117 transitions. [2025-03-09 05:59:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 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-09 05:59:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1117 transitions. [2025-03-09 05:59:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-09 05:59:58,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:59:58,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:59:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:59:58,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 05:59:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:59:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1137485479, now seen corresponding path program 1 times [2025-03-09 05:59:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:59:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169283129] [2025-03-09 05:59:58,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:59:58,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-09 05:59:58,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-09 05:59:58,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:59:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169283129] [2025-03-09 05:59:59,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169283129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:59:59,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830785306] [2025-03-09 05:59:59,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:59:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:59:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:59:59,206 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-09 05:59:59,207 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-09 05:59:59,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-09 05:59:59,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-09 05:59:59,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:59:59,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:59:59,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 05:59:59,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:59:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 05:59:59,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:00:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830785306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:00:00,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:00:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-09 06:00:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120008405] [2025-03-09 06:00:00,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:00:00,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:00:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:00,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:00:00,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:00:00,159 INFO L87 Difference]: Start difference. First operand 796 states and 1117 transitions. Second operand has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:00:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:00,466 INFO L93 Difference]: Finished difference Result 1386 states and 1950 transitions. [2025-03-09 06:00:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:00:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 251 [2025-03-09 06:00:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:00,472 INFO L225 Difference]: With dead ends: 1386 [2025-03-09 06:00:00,472 INFO L226 Difference]: Without dead ends: 1381 [2025-03-09 06:00:00,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:00:00,473 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 2434 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:00,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 2966 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:00:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-09 06:00:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-09 06:00:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1351 states have (on average 1.4056254626202813) internal successors, (1899), 1354 states have internal predecessors, (1899), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-09 06:00:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1941 transitions. [2025-03-09 06:00:00,503 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1941 transitions. Word has length 251 [2025-03-09 06:00:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:00,503 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1941 transitions. [2025-03-09 06:00:00,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:00:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1941 transitions. [2025-03-09 06:00:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-09 06:00:00,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:00,507 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:00,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:00:00,707 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,SelfDestructingSolverStorable11 [2025-03-09 06:00:00,708 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1490543743, now seen corresponding path program 1 times [2025-03-09 06:00:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438996671] [2025-03-09 06:00:00,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:00,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-09 06:00:00,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-09 06:00:00,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:00,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438996671] [2025-03-09 06:00:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438996671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:00:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664746158] [2025-03-09 06:00:02,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:00:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:00:02,695 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-09 06:00:02,697 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-09 06:00:03,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-09 06:00:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-09 06:00:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:03,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1711 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:00:03,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:00:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:03,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:00:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664746158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:00:04,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:00:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-09 06:00:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399071828] [2025-03-09 06:00:04,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:00:04,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:00:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:04,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:00:04,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:00:04,065 INFO L87 Difference]: Start difference. First operand 1377 states and 1941 transitions. Second operand has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:00:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:04,792 INFO L93 Difference]: Finished difference Result 1976 states and 2796 transitions. [2025-03-09 06:00:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 06:00:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 329 [2025-03-09 06:00:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:04,803 INFO L225 Difference]: With dead ends: 1976 [2025-03-09 06:00:04,803 INFO L226 Difference]: Without dead ends: 1975 [2025-03-09 06:00:04,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 06:00:04,807 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2768 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:04,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 4358 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:00:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-09 06:00:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1965. [2025-03-09 06:00:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1930 states have (on average 1.405699481865285) internal successors, (2713), 1933 states have internal predecessors, (2713), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2773 transitions. [2025-03-09 06:00:04,865 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2773 transitions. Word has length 329 [2025-03-09 06:00:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2773 transitions. [2025-03-09 06:00:04,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:00:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2773 transitions. [2025-03-09 06:00:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-09 06:00:04,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:04,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:04,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:00:05,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:00:05,073 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-09 06:00:05,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1037784546, now seen corresponding path program 1 times [2025-03-09 06:00:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335726256] [2025-03-09 06:00:05,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-09 06:00:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-09 06:00:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335726256] [2025-03-09 06:00:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335726256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:00:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972086980] [2025-03-09 06:00:07,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:07,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:00:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:00:07,082 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-09 06:00:07,084 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-09 06:00:07,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-09 06:00:07,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-09 06:00:07,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:07,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:07,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 06:00:07,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:00:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:08,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:00:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972086980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:00:08,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:00:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-09 06:00:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472065793] [2025-03-09 06:00:08,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:00:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:00:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:08,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:00:08,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:00:08,391 INFO L87 Difference]: Start difference. First operand 1965 states and 2773 transitions. Second operand has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:00:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:08,949 INFO L93 Difference]: Finished difference Result 1976 states and 2790 transitions. [2025-03-09 06:00:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:00:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 330 [2025-03-09 06:00:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:08,957 INFO L225 Difference]: With dead ends: 1976 [2025-03-09 06:00:08,957 INFO L226 Difference]: Without dead ends: 1975 [2025-03-09 06:00:08,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 06:00:08,958 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 3306 mSDsluCounter, 4355 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:08,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3329 Valid, 4616 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:00:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-09 06:00:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1966. [2025-03-09 06:00:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1931 states have (on average 1.402900051786639) internal successors, (2709), 1934 states have internal predecessors, (2709), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2769 transitions. [2025-03-09 06:00:08,996 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2769 transitions. Word has length 330 [2025-03-09 06:00:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:08,997 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2769 transitions. [2025-03-09 06:00:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:00:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2769 transitions. [2025-03-09 06:00:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-03-09 06:00:09,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:09,005 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:09,015 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-09 06:00:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:00:09,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:09,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 447394407, now seen corresponding path program 2 times [2025-03-09 06:00:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499303971] [2025-03-09 06:00:09,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:00:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:09,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 559 statements into 2 equivalence classes. [2025-03-09 06:00:09,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 559 of 559 statements. [2025-03-09 06:00:09,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:00:09,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499303971] [2025-03-09 06:00:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499303971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:00:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406556313] [2025-03-09 06:00:10,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:00:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:00:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:00:10,601 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-09 06:00:10,602 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-09 06:00:11,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 559 statements into 2 equivalence classes. [2025-03-09 06:00:11,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 559 of 559 statements. [2025-03-09 06:00:11,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:00:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:11,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:00:11,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:00:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:11,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:00:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:00:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406556313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:00:12,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:00:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-09 06:00:12,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813588186] [2025-03-09 06:00:12,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:00:12,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:00:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:00:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:00:12,308 INFO L87 Difference]: Start difference. First operand 1966 states and 2769 transitions. Second operand has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:00:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:12,718 INFO L93 Difference]: Finished difference Result 1971 states and 2774 transitions. [2025-03-09 06:00:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:00:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 559 [2025-03-09 06:00:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:12,728 INFO L225 Difference]: With dead ends: 1971 [2025-03-09 06:00:12,729 INFO L226 Difference]: Without dead ends: 1966 [2025-03-09 06:00:12,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1101 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:00:12,731 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 5515 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5541 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:12,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5541 Valid, 3625 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:00:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-03-09 06:00:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2025-03-09 06:00:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1931 states have (on average 1.4013464526152253) internal successors, (2706), 1934 states have internal predecessors, (2706), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2766 transitions. [2025-03-09 06:00:12,780 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2766 transitions. Word has length 559 [2025-03-09 06:00:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:12,782 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2766 transitions. [2025-03-09 06:00:12,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 06:00:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2766 transitions. [2025-03-09 06:00:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-09 06:00:12,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:12,801 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:12,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:00:13,002 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,SelfDestructingSolverStorable14 [2025-03-09 06:00:13,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1713210770, now seen corresponding path program 3 times [2025-03-09 06:00:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474530339] [2025-03-09 06:00:13,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:00:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:13,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 790 statements into 12 equivalence classes. [2025-03-09 06:00:13,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 82 of 790 statements. [2025-03-09 06:00:13,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:00:13,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3461 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2823 trivial. 0 not checked. [2025-03-09 06:00:13,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474530339] [2025-03-09 06:00:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474530339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:00:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:00:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:00:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038967240] [2025-03-09 06:00:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:00:13,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:00:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:13,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:00:13,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:00:13,516 INFO L87 Difference]: Start difference. First operand 1966 states and 2766 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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-09 06:00:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:14,023 INFO L93 Difference]: Finished difference Result 4187 states and 5862 transitions. [2025-03-09 06:00:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:00:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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 790 [2025-03-09 06:00:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:14,034 INFO L225 Difference]: With dead ends: 4187 [2025-03-09 06:00:14,035 INFO L226 Difference]: Without dead ends: 2306 [2025-03-09 06:00:14,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:00:14,040 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 13 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:14,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 792 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:00:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-09 06:00:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2266. [2025-03-09 06:00:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2231 states have (on average 1.3787539220080682) internal successors, (3076), 2234 states have internal predecessors, (3076), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3136 transitions. [2025-03-09 06:00:14,082 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3136 transitions. Word has length 790 [2025-03-09 06:00:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 2266 states and 3136 transitions. [2025-03-09 06:00:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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-09 06:00:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3136 transitions. [2025-03-09 06:00:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-03-09 06:00:14,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:14,090 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:14,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:00:14,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1962984658, now seen corresponding path program 1 times [2025-03-09 06:00:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989256035] [2025-03-09 06:00:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:14,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 800 statements into 1 equivalence classes. [2025-03-09 06:00:14,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 800 of 800 statements. [2025-03-09 06:00:14,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:14,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2025-03-09 06:00:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989256035] [2025-03-09 06:00:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989256035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:00:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:00:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:00:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248158054] [2025-03-09 06:00:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:00:15,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:00:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:15,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:00:15,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:00:15,367 INFO L87 Difference]: Start difference. First operand 2266 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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-09 06:00:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:15,871 INFO L93 Difference]: Finished difference Result 4527 states and 6289 transitions. [2025-03-09 06:00:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:00:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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 800 [2025-03-09 06:00:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:15,880 INFO L225 Difference]: With dead ends: 4527 [2025-03-09 06:00:15,880 INFO L226 Difference]: Without dead ends: 2386 [2025-03-09 06:00:15,884 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-09 06:00:15,885 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 14 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:15,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 952 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:00:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-09 06:00:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2356. [2025-03-09 06:00:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2321 states have (on average 1.3813011632916845) internal successors, (3206), 2324 states have internal predecessors, (3206), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3266 transitions. [2025-03-09 06:00:15,933 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3266 transitions. Word has length 800 [2025-03-09 06:00:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:15,934 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3266 transitions. [2025-03-09 06:00:15,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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-09 06:00:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3266 transitions. [2025-03-09 06:00:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-09 06:00:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:15,942 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:15,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:00:15,942 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash 304453656, now seen corresponding path program 1 times [2025-03-09 06:00:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005033671] [2025-03-09 06:00:15,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:16,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-03-09 06:00:16,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-03-09 06:00:16,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:16,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-03-09 06:00:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005033671] [2025-03-09 06:00:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005033671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:00:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:00:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:00:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277284940] [2025-03-09 06:00:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:00:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:00:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:17,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:00:17,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:00:17,396 INFO L87 Difference]: Start difference. First operand 2356 states and 3266 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-09 06:00:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:17,737 INFO L93 Difference]: Finished difference Result 4615 states and 6407 transitions. [2025-03-09 06:00:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:00:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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 810 [2025-03-09 06:00:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:17,747 INFO L225 Difference]: With dead ends: 4615 [2025-03-09 06:00:17,747 INFO L226 Difference]: Without dead ends: 2386 [2025-03-09 06:00:17,753 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-09 06:00:17,753 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 8 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:17,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 819 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:00:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-09 06:00:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2025-03-09 06:00:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2351 states have (on average 1.3764355593364526) internal successors, (3236), 2354 states have internal predecessors, (3236), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3296 transitions. [2025-03-09 06:00:17,803 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3296 transitions. Word has length 810 [2025-03-09 06:00:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:17,804 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3296 transitions. [2025-03-09 06:00:17,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-09 06:00:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3296 transitions. [2025-03-09 06:00:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-09 06:00:17,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:17,815 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:00:17,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1793139680, now seen corresponding path program 1 times [2025-03-09 06:00:17,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:17,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201281286] [2025-03-09 06:00:17,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:18,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-03-09 06:00:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-03-09 06:00:18,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:00:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:00:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2025-03-09 06:00:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:00:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201281286] [2025-03-09 06:00:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201281286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:00:20,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:00:20,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:00:20,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076414438] [2025-03-09 06:00:20,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:00:20,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:00:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:00:20,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:00:20,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:00:20,070 INFO L87 Difference]: Start difference. First operand 2386 states and 3296 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 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-09 06:00:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:00:20,747 INFO L93 Difference]: Finished difference Result 4780 states and 6619 transitions. [2025-03-09 06:00:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:00:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 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 810 [2025-03-09 06:00:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:00:20,754 INFO L225 Difference]: With dead ends: 4780 [2025-03-09 06:00:20,754 INFO L226 Difference]: Without dead ends: 2526 [2025-03-09 06:00:20,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:00:20,757 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 31 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:00:20,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1362 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 06:00:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2025-03-09 06:00:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2466. [2025-03-09 06:00:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2431 states have (on average 1.37227478403949) internal successors, (3336), 2434 states have internal predecessors, (3336), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 06:00:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3396 transitions. [2025-03-09 06:00:20,826 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3396 transitions. Word has length 810 [2025-03-09 06:00:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:00:20,827 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3396 transitions. [2025-03-09 06:00:20,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 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-09 06:00:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3396 transitions. [2025-03-09 06:00:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-09 06:00:20,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:00:20,839 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:00:20,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:00:20,839 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:00:20,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:00:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -237235490, now seen corresponding path program 1 times [2025-03-09 06:00:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:00:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654958782] [2025-03-09 06:00:20,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:00:20,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:00:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes.