./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 67c8082717fe688b9b5c45f5dc06a128b840b4fa3a77916999a526ea5d3d2e54 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:44:19,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:44:19,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:44:19,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:44:19,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:44:20,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:44:20,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:44:20,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:44:20,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:44:20,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:44:20,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:44:20,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:44:20,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:44:20,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:44:20,024 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:44:20,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:44:20,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:44:20,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:44:20,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:44:20,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:44:20,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:20,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:44:20,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:20,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:44:20,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:44:20,027 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67c8082717fe688b9b5c45f5dc06a128b840b4fa3a77916999a526ea5d3d2e54 [2025-01-10 04:44:20,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:44:20,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:44:20,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:44:20,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:44:20,293 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:44:20,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_good.i [2025-01-10 04:44:21,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fed88e9d/f563c7badbf1472fa341a8787645bb54/FLAG0a6f48f6b [2025-01-10 04:44:22,006 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:44:22,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_good.i [2025-01-10 04:44:22,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fed88e9d/f563c7badbf1472fa341a8787645bb54/FLAG0a6f48f6b [2025-01-10 04:44:22,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fed88e9d/f563c7badbf1472fa341a8787645bb54 [2025-01-10 04:44:22,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:44:22,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:44:22,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:44:22,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:44:22,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:44:22,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:44:22" (1/1) ... [2025-01-10 04:44:22,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4919ae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:22, skipping insertion in model container [2025-01-10 04:44:22,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:44:22" (1/1) ... [2025-01-10 04:44:22,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:44:22,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:44:22,849 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:44:22,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:44:23,047 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:44:23,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23 WrapperNode [2025-01-10 04:44:23,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:44:23,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:44:23,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:44:23,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:44:23,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,088 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2025-01-10 04:44:23,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:44:23,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:44:23,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:44:23,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:44:23,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,106 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:44:23,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:44:23,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:44:23,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:44:23,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:44:23,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (1/1) ... [2025-01-10 04:44:23,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:23,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:23,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 04:44:23,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 04:44:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:44:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:44:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:44:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:44:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:44:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:44:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:44:23,279 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:44:23,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:44:23,510 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-01-10 04:44:23,513 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:44:23,522 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:44:23,523 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:44:23,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:23 BoogieIcfgContainer [2025-01-10 04:44:23,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:44:23,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:44:23,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:44:23,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:44:23,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:44:22" (1/3) ... [2025-01-10 04:44:23,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d918c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:44:23, skipping insertion in model container [2025-01-10 04:44:23,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:23" (2/3) ... [2025-01-10 04:44:23,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d918c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:44:23, skipping insertion in model container [2025-01-10 04:44:23,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:23" (3/3) ... [2025-01-10 04:44:23,532 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_17_good.i [2025-01-10 04:44:23,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:44:23,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_preinc_17_good.i that has 3 procedures, 76 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 04:44:23,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:44:23,593 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;@2cf9c17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:44:23,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 04:44:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 69 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:44:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 04:44:23,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:23,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:23,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1873485167, now seen corresponding path program 1 times [2025-01-10 04:44:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:23,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339231864] [2025-01-10 04:44:23,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:23,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 04:44:23,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 04:44:23,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:23,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:23,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339231864] [2025-01-10 04:44:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339231864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100298396] [2025-01-10 04:44:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:23,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:23,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:23,798 INFO L87 Difference]: Start difference. First operand has 76 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 69 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:23,833 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2025-01-10 04:44:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 04:44:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:23,840 INFO L225 Difference]: With dead ends: 144 [2025-01-10 04:44:23,840 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 04:44:23,844 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-01-10 04:44:23,846 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:23,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 04:44:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2025-01-10 04:44:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 64 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-01-10 04:44:23,884 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 12 [2025-01-10 04:44:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-01-10 04:44:23,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-01-10 04:44:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 04:44:23,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:23,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:23,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:44:23,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1731303436, now seen corresponding path program 1 times [2025-01-10 04:44:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744098603] [2025-01-10 04:44:23,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:23,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 04:44:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 04:44:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744098603] [2025-01-10 04:44:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744098603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334395990] [2025-01-10 04:44:24,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:44:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:44:24,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:44:24,017 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,059 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2025-01-10 04:44:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:44:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 04:44:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,060 INFO L225 Difference]: With dead ends: 96 [2025-01-10 04:44:24,060 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 04:44:24,061 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-01-10 04:44:24,061 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 30 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 248 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 04:44:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-10 04:44:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.5657894736842106) internal successors, (119), 88 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2025-01-10 04:44:24,071 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 16 [2025-01-10 04:44:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2025-01-10 04:44:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2025-01-10 04:44:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 04:44:24,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,074 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] [2025-01-10 04:44:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:44:24,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -335798371, now seen corresponding path program 1 times [2025-01-10 04:44:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188642264] [2025-01-10 04:44:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:24,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 04:44:24,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 04:44:24,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188642264] [2025-01-10 04:44:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188642264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 04:44:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178144006] [2025-01-10 04:44:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 04:44:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 04:44:24,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 04:44:24,286 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,371 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2025-01-10 04:44:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 04:44:24,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 04:44:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,372 INFO L225 Difference]: With dead ends: 142 [2025-01-10 04:44:24,373 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 04:44:24,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 04:44:24,373 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 53 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 395 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 04:44:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2025-01-10 04:44:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.5483870967741935) internal successors, (144), 105 states have internal predecessors, (144), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:44:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2025-01-10 04:44:24,383 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 21 [2025-01-10 04:44:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2025-01-10 04:44:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2025-01-10 04:44:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 04:44:24,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,384 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] [2025-01-10 04:44:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:44:24,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:24,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -624352713, now seen corresponding path program 1 times [2025-01-10 04:44:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494794060] [2025-01-10 04:44:24,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:24,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 04:44:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 04:44:24,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494794060] [2025-01-10 04:44:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494794060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:24,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:24,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626865338] [2025-01-10 04:44:24,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:24,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:24,477 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,498 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2025-01-10 04:44:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 04:44:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,499 INFO L225 Difference]: With dead ends: 112 [2025-01-10 04:44:24,499 INFO L226 Difference]: Without dead ends: 111 [2025-01-10 04:44:24,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:24,500 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-10 04:44:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2025-01-10 04:44:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 87 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-01-10 04:44:24,515 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 21 [2025-01-10 04:44:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,516 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-01-10 04:44:24,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2025-01-10 04:44:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 04:44:24,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,517 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] [2025-01-10 04:44:24,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:44:24,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1819814765, now seen corresponding path program 1 times [2025-01-10 04:44:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13009049] [2025-01-10 04:44:24,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 04:44:24,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 04:44:24,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 04:44:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13009049] [2025-01-10 04:44:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13009049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361781169] [2025-01-10 04:44:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:24,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:24,556 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,574 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2025-01-10 04:44:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 04:44:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,575 INFO L225 Difference]: With dead ends: 93 [2025-01-10 04:44:24,575 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 04:44:24,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:24,575 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 04:44:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-10 04:44:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 86 states have internal predecessors, (117), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2025-01-10 04:44:24,584 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 22 [2025-01-10 04:44:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2025-01-10 04:44:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2025-01-10 04:44:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 04:44:24,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,587 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] [2025-01-10 04:44:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:44:24,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:24,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1819200014, now seen corresponding path program 1 times [2025-01-10 04:44:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287259499] [2025-01-10 04:44:24,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:24,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 04:44:24,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 04:44:24,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 04:44:24,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287259499] [2025-01-10 04:44:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287259499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373822299] [2025-01-10 04:44:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:24,642 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,661 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2025-01-10 04:44:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 04:44:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,664 INFO L225 Difference]: With dead ends: 120 [2025-01-10 04:44:24,664 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 04:44:24,664 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-01-10 04:44:24,664 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 04:44:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2025-01-10 04:44:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 87 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-01-10 04:44:24,671 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 22 [2025-01-10 04:44:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,671 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-01-10 04:44:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2025-01-10 04:44:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 04:44:24,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 04:44:24,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1908003642, now seen corresponding path program 1 times [2025-01-10 04:44:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:24,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199801008] [2025-01-10 04:44:24,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:24,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 04:44:24,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 04:44:24,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199801008] [2025-01-10 04:44:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199801008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:44:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478311815] [2025-01-10 04:44:24,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:24,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:24,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 04:44:24,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 04:44:24,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 04:44:24,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 04:44:24,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:24,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:24,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:44:24,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:44:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:24,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:44:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478311815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:24,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:44:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:44:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135146328] [2025-01-10 04:44:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:44:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:44:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:24,884 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:24,899 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2025-01-10 04:44:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:44:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 04:44:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:24,900 INFO L225 Difference]: With dead ends: 131 [2025-01-10 04:44:24,900 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 04:44:24,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:24,901 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 29 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:24,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 236 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 04:44:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 04:44:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.471698113207547) internal successors, (78), 61 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-01-10 04:44:24,908 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 25 [2025-01-10 04:44:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:24,908 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-01-10 04:44:24,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-01-10 04:44:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 04:44:24,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:24,908 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] [2025-01-10 04:44:24,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 04:44:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:25,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1933702154, now seen corresponding path program 1 times [2025-01-10 04:44:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087075013] [2025-01-10 04:44:25,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:25,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 04:44:25,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 04:44:25,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 04:44:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087075013] [2025-01-10 04:44:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087075013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092922052] [2025-01-10 04:44:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:44:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:25,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:44:25,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:44:25,165 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:44:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:25,190 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2025-01-10 04:44:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:44:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-10 04:44:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:25,192 INFO L225 Difference]: With dead ends: 78 [2025-01-10 04:44:25,192 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 04:44:25,193 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-01-10 04:44:25,193 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:25,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 04:44:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 04:44:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 69 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 04:44:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-01-10 04:44:25,204 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 27 [2025-01-10 04:44:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-01-10 04:44:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:44:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-01-10 04:44:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 04:44:25,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:25,207 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] [2025-01-10 04:44:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 04:44:25,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:25,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 736821353, now seen corresponding path program 1 times [2025-01-10 04:44:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354537354] [2025-01-10 04:44:25,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:25,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 04:44:25,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 04:44:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:25,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354537354] [2025-01-10 04:44:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354537354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435127671] [2025-01-10 04:44:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:25,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:44:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:25,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:44:25,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:44:25,271 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 04:44:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:25,288 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2025-01-10 04:44:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:44:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-01-10 04:44:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:25,289 INFO L225 Difference]: With dead ends: 95 [2025-01-10 04:44:25,290 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 04:44:25,290 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-01-10 04:44:25,290 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:25,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 241 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 04:44:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-10 04:44:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 72 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 04:44:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2025-01-10 04:44:25,299 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 32 [2025-01-10 04:44:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:25,299 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2025-01-10 04:44:25,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 04:44:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2025-01-10 04:44:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 04:44:25,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:25,300 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 04:44:25,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 04:44:25,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:25,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -932756928, now seen corresponding path program 1 times [2025-01-10 04:44:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180331129] [2025-01-10 04:44:25,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:25,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 04:44:25,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 04:44:25,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180331129] [2025-01-10 04:44:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180331129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:44:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667260474] [2025-01-10 04:44:25,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:25,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:25,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 04:44:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 04:44:25,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 04:44:25,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 04:44:25,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:44:25,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:44:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:25,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:44:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667260474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:44:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:44:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414043890] [2025-01-10 04:44:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:44:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:25,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:44:25,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:25,452 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-01-10 04:44:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:25,464 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2025-01-10 04:44:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:44:25,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 35 [2025-01-10 04:44:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:25,465 INFO L225 Difference]: With dead ends: 94 [2025-01-10 04:44:25,465 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 04:44:25,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:25,466 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:25,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 04:44:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 04:44:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 68 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 04:44:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-01-10 04:44:25,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 35 [2025-01-10 04:44:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:25,470 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-01-10 04:44:25,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-01-10 04:44:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-01-10 04:44:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 04:44:25,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:25,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:25,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 04:44:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:25,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:25,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1039977505, now seen corresponding path program 1 times [2025-01-10 04:44:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718513564] [2025-01-10 04:44:25,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:25,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 04:44:25,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 04:44:25,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 04:44:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718513564] [2025-01-10 04:44:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718513564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:44:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854858301] [2025-01-10 04:44:25,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:25,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 04:44:25,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 04:44:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 04:44:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 04:44:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:25,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:44:25,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:44:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 04:44:25,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:44:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854858301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:44:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:44:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127510792] [2025-01-10 04:44:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:25,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:44:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:25,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:44:25,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:25,986 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:44:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:26,054 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-01-10 04:44:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:44:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-01-10 04:44:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:26,055 INFO L225 Difference]: With dead ends: 99 [2025-01-10 04:44:26,055 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 04:44:26,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:26,056 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:26,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 287 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 04:44:26,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 04:44:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 04:44:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 58 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-01-10 04:44:26,063 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 37 [2025-01-10 04:44:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:26,063 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-01-10 04:44:26,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:44:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-01-10 04:44:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 04:44:26,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:26,064 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] [2025-01-10 04:44:26,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 04:44:26,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:26,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1149312493, now seen corresponding path program 1 times [2025-01-10 04:44:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709754852] [2025-01-10 04:44:26,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:26,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 04:44:26,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 04:44:26,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709754852] [2025-01-10 04:44:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709754852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:26,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:26,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706381026] [2025-01-10 04:44:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:26,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:26,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:26,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:26,324 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-01-10 04:44:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:26,338 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-01-10 04:44:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 36 [2025-01-10 04:44:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:26,339 INFO L225 Difference]: With dead ends: 69 [2025-01-10 04:44:26,342 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 04:44:26,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:26,343 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:26,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 04:44:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 04:44:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 61 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:44:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-01-10 04:44:26,350 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 36 [2025-01-10 04:44:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:26,350 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-01-10 04:44:26,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-01-10 04:44:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-01-10 04:44:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 04:44:26,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:26,351 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] [2025-01-10 04:44:26,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 04:44:26,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:26,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1917066886, now seen corresponding path program 1 times [2025-01-10 04:44:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075199690] [2025-01-10 04:44:26,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:26,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 04:44:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 04:44:26,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:26,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 04:44:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075199690] [2025-01-10 04:44:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075199690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246289693] [2025-01-10 04:44:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:26,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:44:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:26,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:44:26,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:44:26,452 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 04:44:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:26,484 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2025-01-10 04:44:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:44:26,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-10 04:44:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:26,488 INFO L225 Difference]: With dead ends: 73 [2025-01-10 04:44:26,488 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 04:44:26,488 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-01-10 04:44:26,488 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:26,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 04:44:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-10 04:44:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 64 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:44:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2025-01-10 04:44:26,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 43 [2025-01-10 04:44:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:26,500 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-01-10 04:44:26,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 04:44:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2025-01-10 04:44:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 04:44:26,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:26,501 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 04:44:26,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 04:44:26,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1159647315, now seen corresponding path program 1 times [2025-01-10 04:44:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254299333] [2025-01-10 04:44:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:26,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 04:44:26,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 04:44:26,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:26,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 04:44:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254299333] [2025-01-10 04:44:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254299333] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:44:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536355470] [2025-01-10 04:44:26,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:26,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:26,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:26,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 04:44:26,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 04:44:26,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 04:44:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 04:44:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:26,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 04:44:26,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:44:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:26,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:44:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536355470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:44:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-10 04:44:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284708546] [2025-01-10 04:44:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:44:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:44:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:26,775 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 04:44:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:26,789 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-01-10 04:44:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:44:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-01-10 04:44:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:26,790 INFO L225 Difference]: With dead ends: 71 [2025-01-10 04:44:26,790 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 04:44:26,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:44:26,790 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 04:44:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 04:44:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3) internal successors, (78), 63 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:44:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2025-01-10 04:44:26,795 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 46 [2025-01-10 04:44:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:26,795 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2025-01-10 04:44:26,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 04:44:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2025-01-10 04:44:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 04:44:26,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:26,797 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 04:44:26,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 04:44:27,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 04:44:27,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:44:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1589328574, now seen corresponding path program 1 times [2025-01-10 04:44:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723799371] [2025-01-10 04:44:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:27,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 04:44:27,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 04:44:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 04:44:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723799371] [2025-01-10 04:44:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723799371] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:44:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612149907] [2025-01-10 04:44:27,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:44:27,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:27,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 04:44:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 04:44:27,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 04:44:27,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 04:44:27,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:27,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 04:44:27,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:44:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:27,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 04:44:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:44:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612149907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 04:44:27,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 04:44:27,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-10 04:44:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241461046] [2025-01-10 04:44:27,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 04:44:27,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 04:44:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:27,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 04:44:27,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 04:44:27,257 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 04:44:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:27,306 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2025-01-10 04:44:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 04:44:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 47 [2025-01-10 04:44:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:27,307 INFO L225 Difference]: With dead ends: 74 [2025-01-10 04:44:27,307 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:44:27,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-10 04:44:27,308 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:27,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:44:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:44:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-01-10 04:44:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:44:27,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-01-10 04:44:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:27,310 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:44:27,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 04:44:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:44:27,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:44:27,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 04:44:27,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 04:44:27,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 04:44:27,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 04:44:27,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 04:44:27,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 04:44:27,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 04:44:27,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 04:44:27,522 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:27,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:44:27,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:44:27,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:44:27 BoogieIcfgContainer [2025-01-10 04:44:27,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:44:27,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:44:27,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:44:27,602 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:44:27,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:23" (3/4) ... [2025-01-10 04:44:27,604 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:44:27,609 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:44:27,609 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:44:27,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 04:44:27,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 04:44:27,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 04:44:27,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:44:27,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:44:27,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:44:27,687 INFO L158 Benchmark]: Toolchain (without parser) took 5534.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 101.7MB in the beginning and 230.6MB in the end (delta: -128.9MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2025-01-10 04:44:27,687 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:27,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 897.03ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 41.0MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 04:44:27,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.09ms. Allocated memory is still 142.6MB. Free memory was 41.0MB in the beginning and 38.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:27,688 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 142.6MB. Free memory was 38.1MB in the beginning and 36.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:27,688 INFO L158 Benchmark]: RCFGBuilder took 404.07ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 88.3MB in the end (delta: -52.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-01-10 04:44:27,688 INFO L158 Benchmark]: TraceAbstraction took 4076.31ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 87.9MB in the beginning and 237.6MB in the end (delta: -149.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-01-10 04:44:27,688 INFO L158 Benchmark]: Witness Printer took 84.19ms. Allocated memory is still 335.5MB. Free memory was 237.6MB in the beginning and 230.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:44:27,691 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 897.03ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 41.0MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.09ms. Allocated memory is still 142.6MB. Free memory was 41.0MB in the beginning and 38.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 142.6MB. Free memory was 38.1MB in the beginning and 36.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.07ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 88.3MB in the end (delta: -52.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4076.31ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 87.9MB in the beginning and 237.6MB in the end (delta: -149.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 84.19ms. Allocated memory is still 335.5MB. Free memory was 237.6MB in the beginning and 230.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 3437 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2218 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1219 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 76 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 134/145 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((1 <= i) && (0 <= (data + 2147483648))) || (((i == 0) && (0 <= data)) && (data <= 2147483646))) - InvariantResult [Line: 1576]: Loop Invariant Derived loop invariant: (((data <= 2) && (h == 0)) || ((1 <= h) && (data == 2))) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: (((1 <= j) && (data == 3)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((k == 0) && (0 <= (data + 2147483648))) || ((1 <= k) && (0 <= (data + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2025-01-10 04:44:27,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE