./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/array-memsafety/openbsd_cstrcspn-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:21:29,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:21:29,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:21:29,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:21:29,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:21:29,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:21:29,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:21:29,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:21:29,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:21:29,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:21:29,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:21:29,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:21:29,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:21:29,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:21:29,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:21:29,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:21:29,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:21:29,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:21:29,623 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d [2025-02-06 13:21:29,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:21:29,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:21:29,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:21:29,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:21:29,834 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:21:29,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-02-06 13:21:31,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e055b12/8987d4d443894969b430077d27f3886d/FLAGefb58a75e [2025-02-06 13:21:31,396 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:21:31,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-02-06 13:21:31,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e055b12/8987d4d443894969b430077d27f3886d/FLAGefb58a75e [2025-02-06 13:21:31,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e055b12/8987d4d443894969b430077d27f3886d [2025-02-06 13:21:31,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:21:31,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:21:31,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:21:31,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:21:31,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:21:31,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc982b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31, skipping insertion in model container [2025-02-06 13:21:31,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:21:31,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:21:31,615 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:21:31,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:21:31,663 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:21:31,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31 WrapperNode [2025-02-06 13:21:31,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:21:31,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:21:31,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:21:31,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:21:31,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,686 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2025-02-06 13:21:31,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:21:31,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:21:31,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:21:31,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:21:31,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,702 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 13:21:31,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:21:31,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:21:31,709 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:21:31,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:21:31,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (1/1) ... [2025-02-06 13:21:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:21:31,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:31,733 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-02-06 13:21:31,736 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-02-06 13:21:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:21:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:21:31,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:21:31,812 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:21:31,813 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:21:31,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-02-06 13:21:31,965 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-06 13:21:31,966 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:21:31,977 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:21:31,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:21:31,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:21:31 BoogieIcfgContainer [2025-02-06 13:21:31,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:21:31,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:21:31,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:21:31,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:21:31,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:21:31" (1/3) ... [2025-02-06 13:21:31,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:21:31, skipping insertion in model container [2025-02-06 13:21:31,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:21:31" (2/3) ... [2025-02-06 13:21:31,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:21:31, skipping insertion in model container [2025-02-06 13:21:31,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:21:31" (3/3) ... [2025-02-06 13:21:31,984 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2025-02-06 13:21:31,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:21:31,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrcspn-alloca-2.i that has 1 procedures, 43 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-02-06 13:21:32,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:21:32,082 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;@60609306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:21:32,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 13:21:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 42 states have internal predecessors, (52), 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-02-06 13:21:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:21:32,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1849352396, now seen corresponding path program 1 times [2025-02-06 13:21:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708649662] [2025-02-06 13:21:32,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:21:32,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:21:32,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708649662] [2025-02-06 13:21:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708649662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951096458] [2025-02-06 13:21:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:32,284 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 42 states have internal predecessors, (52), 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:21:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,320 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-02-06 13:21:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:32,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 13:21:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,326 INFO L225 Difference]: With dead ends: 70 [2025-02-06 13:21:32,326 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:21:32,330 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-02-06 13:21:32,332 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:32,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:21:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:21:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 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-02-06 13:21:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-02-06 13:21:32,360 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2025-02-06 13:21:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,361 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-02-06 13:21:32,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:21:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-02-06 13:21:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:21:32,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:21:32,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1495349413, now seen corresponding path program 1 times [2025-02-06 13:21:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054607819] [2025-02-06 13:21:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:21:32,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:21:32,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054607819] [2025-02-06 13:21:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054607819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802497710] [2025-02-06 13:21:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:32,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:32,439 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-06 13:21:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,468 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-02-06 13:21:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:21:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,469 INFO L225 Difference]: With dead ends: 59 [2025-02-06 13:21:32,469 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:21:32,469 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-02-06 13:21:32,470 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 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-02-06 13:21:32,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:21:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-02-06 13:21:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 50 states have internal predecessors, (63), 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-02-06 13:21:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-02-06 13:21:32,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 8 [2025-02-06 13:21:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,477 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-02-06 13:21:32,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-06 13:21:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-02-06 13:21:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:21:32,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:21:32,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1466720262, now seen corresponding path program 1 times [2025-02-06 13:21:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337589626] [2025-02-06 13:21:32,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:21:32,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:21:32,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337589626] [2025-02-06 13:21:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337589626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856752284] [2025-02-06 13:21:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:32,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:32,531 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-06 13:21:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,553 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-02-06 13:21:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:21:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,555 INFO L225 Difference]: With dead ends: 51 [2025-02-06 13:21:32,555 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 13:21:32,555 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-02-06 13:21:32,555 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:32,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 13:21:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2025-02-06 13:21:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 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-02-06 13:21:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-02-06 13:21:32,558 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2025-02-06 13:21:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,558 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-02-06 13:21:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-06 13:21:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-02-06 13:21:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:21:32,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:21:32,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1783258710, now seen corresponding path program 1 times [2025-02-06 13:21:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236059658] [2025-02-06 13:21:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:21:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:21:32,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236059658] [2025-02-06 13:21:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236059658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:21:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193292981] [2025-02-06 13:21:32,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:21:32,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:21:32,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:32,659 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-06 13:21:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,687 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-02-06 13:21:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:32,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:21:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,688 INFO L225 Difference]: With dead ends: 77 [2025-02-06 13:21:32,688 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 13:21:32,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:32,689 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:32,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 13:21:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2025-02-06 13:21:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 36 states have internal predecessors, (41), 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-02-06 13:21:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-02-06 13:21:32,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2025-02-06 13:21:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-02-06 13:21:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-06 13:21:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-02-06 13:21:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:21:32,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:21:32,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash -768898251, now seen corresponding path program 1 times [2025-02-06 13:21:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469636964] [2025-02-06 13:21:32,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:21:32,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:21:32,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469636964] [2025-02-06 13:21:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469636964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:21:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485658755] [2025-02-06 13:21:32,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:21:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:21:32,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:32,786 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-02-06 13:21:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,819 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-06 13:21:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:21:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,820 INFO L225 Difference]: With dead ends: 45 [2025-02-06 13:21:32,820 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 13:21:32,820 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-02-06 13:21:32,825 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:32,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 13:21:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 13:21:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 42 states have internal predecessors, (48), 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-02-06 13:21:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-06 13:21:32,829 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2025-02-06 13:21:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,829 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-06 13:21:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-02-06 13:21:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-06 13:21:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:21:32,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:21:32,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 19636658, now seen corresponding path program 1 times [2025-02-06 13:21:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291487516] [2025-02-06 13:21:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:21:32,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:21:32,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291487516] [2025-02-06 13:21:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291487516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:32,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877858911] [2025-02-06 13:21:32,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:32,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:32,913 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-06 13:21:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,927 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-02-06 13:21:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 13:21:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,928 INFO L225 Difference]: With dead ends: 43 [2025-02-06 13:21:32,928 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 13:21:32,928 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-02-06 13:21:32,929 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:32,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 13:21:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 13:21:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 40 states have internal predecessors, (46), 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-02-06 13:21:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-06 13:21:32,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 12 [2025-02-06 13:21:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:32,932 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-06 13:21:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-06 13:21:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-06 13:21:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:21:32,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:32,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:21:32,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 608736398, now seen corresponding path program 1 times [2025-02-06 13:21:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186911033] [2025-02-06 13:21:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:32,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:21:32,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:21:32,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:32,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186911033] [2025-02-06 13:21:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186911033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104108535] [2025-02-06 13:21:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:32,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:32,963 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 13:21:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:32,991 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-02-06 13:21:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 13:21:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:32,992 INFO L225 Difference]: With dead ends: 77 [2025-02-06 13:21:32,992 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 13:21:32,992 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-02-06 13:21:32,993 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 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-02-06 13:21:32,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 13:21:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-06 13:21:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 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-02-06 13:21:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-02-06 13:21:33,006 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 13 [2025-02-06 13:21:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,007 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-02-06 13:21:33,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 13:21:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-02-06 13:21:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:21:33,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:21:33,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:33,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash 412222893, now seen corresponding path program 1 times [2025-02-06 13:21:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:33,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025413299] [2025-02-06 13:21:33,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:33,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:21:33,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:21:33,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025413299] [2025-02-06 13:21:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025413299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:21:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940078428] [2025-02-06 13:21:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:33,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:21:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:33,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:21:33,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:21:33,055 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 13:21:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:33,078 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-02-06 13:21:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:21:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 13:21:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:33,078 INFO L225 Difference]: With dead ends: 66 [2025-02-06 13:21:33,078 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 13:21:33,079 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-02-06 13:21:33,079 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:33,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 13:21:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2025-02-06 13:21:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 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-02-06 13:21:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-06 13:21:33,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 13 [2025-02-06 13:21:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,093 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-06 13:21:33,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 13:21:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-02-06 13:21:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:21:33,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:21:33,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:33,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 880126185, now seen corresponding path program 1 times [2025-02-06 13:21:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106511131] [2025-02-06 13:21:33,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:33,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:21:33,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:21:33,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106511131] [2025-02-06 13:21:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106511131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:21:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499537972] [2025-02-06 13:21:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:21:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:33,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:21:33,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:33,140 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-06 13:21:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:33,161 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-06 13:21:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 13:21:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:33,162 INFO L225 Difference]: With dead ends: 67 [2025-02-06 13:21:33,162 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 13:21:33,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:33,162 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:33,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 13:21:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-06 13:21:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 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-02-06 13:21:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-06 13:21:33,165 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 15 [2025-02-06 13:21:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,166 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-06 13:21:33,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-02-06 13:21:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-06 13:21:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:21:33,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:21:33,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:33,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1009208904, now seen corresponding path program 1 times [2025-02-06 13:21:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984981274] [2025-02-06 13:21:33,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:33,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:21:33,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:21:33,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984981274] [2025-02-06 13:21:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984981274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:21:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:21:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525522719] [2025-02-06 13:21:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:21:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:33,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:21:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:21:33,205 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-06 13:21:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:33,221 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-02-06 13:21:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 13:21:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:33,222 INFO L225 Difference]: With dead ends: 55 [2025-02-06 13:21:33,222 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 13:21:33,222 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-02-06 13:21:33,222 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:33,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 13:21:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 13:21:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 52 states have internal predecessors, (59), 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-02-06 13:21:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-02-06 13:21:33,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 15 [2025-02-06 13:21:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,227 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-06 13:21:33,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-06 13:21:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-02-06 13:21:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:21:33,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:21:33,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1221013178, now seen corresponding path program 1 times [2025-02-06 13:21:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155646988] [2025-02-06 13:21:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:33,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:21:33,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:21:33,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155646988] [2025-02-06 13:21:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155646988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978361807] [2025-02-06 13:21:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:33,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:33,289 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-02-06 13:21:33,291 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-02-06 13:21:33,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:21:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:21:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:21:33,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:21:33,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978361807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:33,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:21:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:21:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740368953] [2025-02-06 13:21:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:21:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:33,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:21:33,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:21:33,373 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-02-06 13:21:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:33,405 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-02-06 13:21:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:21:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 13:21:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:33,406 INFO L225 Difference]: With dead ends: 53 [2025-02-06 13:21:33,406 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 13:21:33,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:21:33,407 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:33,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 13:21:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 13:21:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 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-02-06 13:21:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-06 13:21:33,410 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2025-02-06 13:21:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,410 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-06 13:21:33,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-02-06 13:21:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-06 13:21:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:21:33,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,417 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-02-06 13:21:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:21:33,615 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-02-06 13:21:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash -803297139, now seen corresponding path program 1 times [2025-02-06 13:21:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775707877] [2025-02-06 13:21:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:33,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:21:33,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:21:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775707877] [2025-02-06 13:21:33,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775707877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017365411] [2025-02-06 13:21:33,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:33,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:33,661 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-02-06 13:21:33,662 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-02-06 13:21:33,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:21:33,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:21:33,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:33,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:33,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:21:33,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:21:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017365411] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:21:33,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:21:33,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:21:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672826021] [2025-02-06 13:21:33,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:21:33,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:21:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:33,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:21:33,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:21:33,809 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 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-02-06 13:21:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:33,842 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-02-06 13:21:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:21:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 13:21:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:33,845 INFO L225 Difference]: With dead ends: 89 [2025-02-06 13:21:33,845 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 13:21:33,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:21:33,846 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:33,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 13:21:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 13:21:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 87 states have internal predecessors, (96), 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-02-06 13:21:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2025-02-06 13:21:33,851 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 17 [2025-02-06 13:21:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:33,851 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2025-02-06 13:21:33,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 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-02-06 13:21:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2025-02-06 13:21:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:21:33,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:33,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:33,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:21:34,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:34,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1011349997, now seen corresponding path program 1 times [2025-02-06 13:21:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:34,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307339169] [2025-02-06 13:21:34,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:34,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:21:34,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:21:34,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:34,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307339169] [2025-02-06 13:21:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307339169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217495145] [2025-02-06 13:21:34,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:34,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:34,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:34,102 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-02-06 13:21:34,107 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-02-06 13:21:34,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:21:34,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:21:34,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:34,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:21:34,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:34,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:21:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217495145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:21:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:21:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:21:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041933249] [2025-02-06 13:21:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:21:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:21:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:34,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:21:34,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:21:34,185 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 13:21:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:34,200 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2025-02-06 13:21:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:21:34,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 13:21:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:34,201 INFO L225 Difference]: With dead ends: 88 [2025-02-06 13:21:34,201 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 13:21:34,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:21:34,202 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:34,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 13:21:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 13:21:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 86 states have internal predecessors, (95), 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-02-06 13:21:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2025-02-06 13:21:34,208 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 21 [2025-02-06 13:21:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:34,208 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2025-02-06 13:21:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 13:21:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2025-02-06 13:21:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:21:34,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:34,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:34,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:21:34,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:34,409 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:34,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1287078827, now seen corresponding path program 1 times [2025-02-06 13:21:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:34,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563806370] [2025-02-06 13:21:34,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:34,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:21:34,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:21:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563806370] [2025-02-06 13:21:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563806370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517910326] [2025-02-06 13:21:34,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:21:34,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:34,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:34,455 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-02-06 13:21:34,461 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-02-06 13:21:34,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:21:34,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:21:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:21:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:21:34,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:34,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:21:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:21:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517910326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:21:34,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:21:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:21:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60938672] [2025-02-06 13:21:34,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:21:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:21:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:34,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:21:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:21:34,590 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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-02-06 13:21:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:34,612 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-02-06 13:21:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:21:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 13:21:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:34,613 INFO L225 Difference]: With dead ends: 106 [2025-02-06 13:21:34,613 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 13:21:34,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:21:34,613 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:34,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 13:21:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-06 13:21:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 104 states have internal predecessors, (113), 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-02-06 13:21:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-02-06 13:21:34,618 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 22 [2025-02-06 13:21:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:34,618 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-02-06 13:21:34,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 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-02-06 13:21:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-02-06 13:21:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 13:21:34,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:34,618 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:34,624 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-02-06 13:21:34,818 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-02-06 13:21:34,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 27840094, now seen corresponding path program 2 times [2025-02-06 13:21:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268846035] [2025-02-06 13:21:34,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:21:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:34,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:21:34,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-02-06 13:21:34,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:21:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268846035] [2025-02-06 13:21:34,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268846035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56592211] [2025-02-06 13:21:34,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:21:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:34,849 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-02-06 13:21:34,851 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-02-06 13:21:34,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:21:34,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-02-06 13:21:34,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:21:34,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:34,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:21:34,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:34,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:21:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56592211] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:21:34,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:21:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 13:21:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270137384] [2025-02-06 13:21:34,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:21:34,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:21:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:34,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:21:34,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:21:34,989 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-02-06 13:21:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:35,014 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-02-06 13:21:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 13:21:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:35,015 INFO L225 Difference]: With dead ends: 105 [2025-02-06 13:21:35,015 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 13:21:35,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:21:35,015 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:35,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 13:21:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2025-02-06 13:21:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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-02-06 13:21:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-02-06 13:21:35,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 35 [2025-02-06 13:21:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:35,018 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-02-06 13:21:35,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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-02-06 13:21:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-02-06 13:21:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 13:21:35,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:21:35,018 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:35,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:21:35,219 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-02-06 13:21:35,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-06 13:21:35,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:21:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1687350556, now seen corresponding path program 2 times [2025-02-06 13:21:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:21:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024011905] [2025-02-06 13:21:35,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:21:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:21:35,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-06 13:21:35,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 40 statements. [2025-02-06 13:21:35,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:21:35,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:21:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024011905] [2025-02-06 13:21:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024011905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:21:35,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952488326] [2025-02-06 13:21:35,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:21:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:21:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:21:35,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:21:35,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:21:35,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-06 13:21:35,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 40 statements. [2025-02-06 13:21:35,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:21:35,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:21:35,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:21:35,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:21:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:35,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:21:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 13:21:35,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952488326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:21:35,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:21:35,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 13:21:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587815152] [2025-02-06 13:21:35,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:21:35,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:21:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:21:35,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:21:35,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:21:35,476 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-02-06 13:21:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:21:35,494 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-02-06 13:21:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:21:35,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-06 13:21:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:21:35,494 INFO L225 Difference]: With dead ends: 49 [2025-02-06 13:21:35,494 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:21:35,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:21:35,495 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:21:35,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:21:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:21:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:21:35,495 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-02-06 13:21:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:21:35,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-02-06 13:21:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:21:35,495 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:21:35,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-02-06 13:21:35,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:21:35,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:21:35,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-02-06 13:21:35,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-02-06 13:21:35,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-02-06 13:21:35,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-02-06 13:21:35,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-02-06 13:21:35,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:21:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:21:35,707 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:21:35,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:21:35,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:21:35,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:21:35 BoogieIcfgContainer [2025-02-06 13:21:35,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:21:35,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:21:35,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:21:35,912 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:21:35,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:21:31" (3/4) ... [2025-02-06 13:21:35,916 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:21:35,925 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 13:21:35,925 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:21:35,925 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:21:35,926 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:21:36,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:21:36,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:21:36,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:21:36,026 INFO L158 Benchmark]: Toolchain (without parser) took 4608.86ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 71.3MB in the end (delta: 60.1MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2025-02-06 13:21:36,026 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:21:36,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.32ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 114.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:21:36,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 113.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:21:36,027 INFO L158 Benchmark]: Boogie Preprocessor took 21.06ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:21:36,027 INFO L158 Benchmark]: IcfgBuilder took 268.50ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:21:36,027 INFO L158 Benchmark]: TraceAbstraction took 3932.96ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 78.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2025-02-06 13:21:36,027 INFO L158 Benchmark]: Witness Printer took 113.82ms. Allocated memory is still 167.8MB. Free memory was 78.4MB in the beginning and 71.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:21:36,028 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.32ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 114.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 113.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.06ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 111.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 268.50ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3932.96ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 78.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 113.82ms. Allocated memory is still 167.8MB. Free memory was 78.4MB in the beginning and 71.3MB in the end (delta: 7.0MB). 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: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 549]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 539]: 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 1 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 946 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 375 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=14, InterpolantAutomatonStates: 74, 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, 16 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 413 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329 SizeOfPredicates, 4 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 322/416 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: 539]: Location Invariant Derived location invariant: ((length2 <= 2147483647) && (((((1 <= i) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) || ((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)))) - InvariantResult [Line: 544]: Location Invariant Derived location invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || (((((1 <= length1) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= i)) && (length2 <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:21:36,055 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