./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops/for_bounded_loop1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/for_bounded_loop1.c -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 d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:42:45,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:42:45,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:42:45,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:42:45,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:42:45,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:42:45,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:42:45,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:42:45,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:42:45,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:42:45,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:42:45,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:42:45,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:42:45,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:42:45,508 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:42:45,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:42:45,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:42:45,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:42:45,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:45,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:45,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:45,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:42:45,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:42:45,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:42:45,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:42:45,513 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 -> d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 [2025-01-10 01:42:45,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:42:45,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:42:45,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:42:45,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:42:45,816 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:42:45,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/for_bounded_loop1.c [2025-01-10 01:42:47,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3317a3f20/f61575840cc74cf793751e8eadc488d9/FLAGde752518f [2025-01-10 01:42:47,298 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:42:47,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2025-01-10 01:42:47,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3317a3f20/f61575840cc74cf793751e8eadc488d9/FLAGde752518f [2025-01-10 01:42:47,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3317a3f20/f61575840cc74cf793751e8eadc488d9 [2025-01-10 01:42:47,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:42:47,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:42:47,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:47,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:42:47,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:42:47,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be44c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47, skipping insertion in model container [2025-01-10 01:42:47,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:42:47,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:47,813 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:42:47,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:47,842 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:42:47,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47 WrapperNode [2025-01-10 01:42:47,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:47,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:47,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:42:47,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:42:47,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,870 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-01-10 01:42:47,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:47,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:42:47,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:42:47,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:42:47,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,894 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:42:47,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:42:47,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:42:47,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:42:47,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:42:47,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (1/1) ... [2025-01-10 01:42:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:47,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:47,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:42:47,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:42:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:42:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:42:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:42:47,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:42:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:42:47,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:42:48,017 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:42:48,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:42:48,151 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-10 01:42:48,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:42:48,160 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:42:48,160 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:42:48,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:48 BoogieIcfgContainer [2025-01-10 01:42:48,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:42:48,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:42:48,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:42:48,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:42:48,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:47" (1/3) ... [2025-01-10 01:42:48,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b90269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:48, skipping insertion in model container [2025-01-10 01:42:48,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:47" (2/3) ... [2025-01-10 01:42:48,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b90269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:48, skipping insertion in model container [2025-01-10 01:42:48,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:48" (3/3) ... [2025-01-10 01:42:48,173 INFO L128 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2025-01-10 01:42:48,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:42:48,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG for_bounded_loop1.c that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:42:48,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:42:48,259 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;@65234a46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:42:48,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:42:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:42:48,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:48,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:42:48,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 28695813, now seen corresponding path program 1 times [2025-01-10 01:42:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815281686] [2025-01-10 01:42:48,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:42:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:42:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815281686] [2025-01-10 01:42:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815281686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:48,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979980966] [2025-01-10 01:42:48,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:48,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:48,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:48,516 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:48,561 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-01-10 01:42:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:42:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:48,568 INFO L225 Difference]: With dead ends: 63 [2025-01-10 01:42:48,569 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:42:48,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:48,574 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:48,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:42:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:42:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-01-10 01:42:48,608 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 5 [2025-01-10 01:42:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:48,609 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-10 01:42:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-01-10 01:42:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:42:48,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:48,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:48,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:42:48,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -131843, now seen corresponding path program 1 times [2025-01-10 01:42:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399053003] [2025-01-10 01:42:48,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:48,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:42:48,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:42:48,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:48,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:48,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399053003] [2025-01-10 01:42:48,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399053003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:48,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:48,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:42:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607005169] [2025-01-10 01:42:48,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:48,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:42:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:48,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:42:48,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:48,763 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:48,827 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-01-10 01:42:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-10 01:42:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:48,830 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:42:48,830 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:42:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:42:48,831 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 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-01-10 01:42:48,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:42:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-01-10 01:42:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-01-10 01:42:48,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 14 [2025-01-10 01:42:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 01:42:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-01-10 01:42:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:42:48,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:48,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:42:48,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -4087077, now seen corresponding path program 1 times [2025-01-10 01:42:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766819846] [2025-01-10 01:42:48,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:48,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:42:48,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:42:48,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:48,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:42:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766819846] [2025-01-10 01:42:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766819846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:48,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:48,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:42:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849535029] [2025-01-10 01:42:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:48,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:42:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:48,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:42:48,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:48,964 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:49,022 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-01-10 01:42:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:42:49,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-10 01:42:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:49,023 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:42:49,023 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:42:49,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:42:49,024 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 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-01-10 01:42:49,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:42:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:42:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:42:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-01-10 01:42:49,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 15 [2025-01-10 01:42:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-01-10 01:42:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:42:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-01-10 01:42:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:42:49,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:49,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:42:49,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -235281593, now seen corresponding path program 1 times [2025-01-10 01:42:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305449748] [2025-01-10 01:42:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:49,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:49,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:49,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:42:49,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:49,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305449748] [2025-01-10 01:42:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305449748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:49,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406768045] [2025-01-10 01:42:49,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:49,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:49,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:49,149 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:49,181 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-01-10 01:42:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:49,181 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-10 01:42:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:49,182 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:42:49,182 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:42:49,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:49,183 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:49,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:42:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:42:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-01-10 01:42:49,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2025-01-10 01:42:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:49,196 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-01-10 01:42:49,196 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:42:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-01-10 01:42:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:42:49,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:49,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:42:49,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 112750905, now seen corresponding path program 1 times [2025-01-10 01:42:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806034725] [2025-01-10 01:42:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:49,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:49,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:49,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:42:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806034725] [2025-01-10 01:42:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806034725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327813591] [2025-01-10 01:42:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:49,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:49,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:49,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:42:49,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:42:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:42:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:49,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:42:49,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:42:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327813591] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:42:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-01-10 01:42:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466588829] [2025-01-10 01:42:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:49,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:49,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:49,516 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:49,549 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-01-10 01:42:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:42:49,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-10 01:42:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:49,551 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:42:49,551 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:42:49,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:42:49,551 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:49,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:42:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:42:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-01-10 01:42:49,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2025-01-10 01:42:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:49,557 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-01-10 01:42:49,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-01-10 01:42:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:42:49,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:49,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:49,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:42:49,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:49,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash -799689196, now seen corresponding path program 1 times [2025-01-10 01:42:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063900046] [2025-01-10 01:42:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:49,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:49,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:49,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:42:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063900046] [2025-01-10 01:42:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063900046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652719581] [2025-01-10 01:42:49,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:49,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:49,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:49,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:42:49,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:42:49,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:42:49,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:49,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:49,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:42:49,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:42:50,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652719581] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:50,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:42:50,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-01-10 01:42:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118271210] [2025-01-10 01:42:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:50,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:50,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:50,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:50,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:50,028 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:50,072 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-01-10 01:42:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-10 01:42:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:50,073 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:42:50,073 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:42:50,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:42:50,075 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:50,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:42:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:42:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-01-10 01:42:50,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2025-01-10 01:42:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-01-10 01:42:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-01-10 01:42:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:42:50,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:50,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:50,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:50,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1853037751, now seen corresponding path program 1 times [2025-01-10 01:42:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577443874] [2025-01-10 01:42:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:50,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:42:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:42:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:42:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577443874] [2025-01-10 01:42:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577443874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089549271] [2025-01-10 01:42:50,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:50,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:50,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:50,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:50,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:42:50,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:42:50,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:42:50,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:50,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:50,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:50,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:42:50,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:42:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089549271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:50,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-10 01:42:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233750020] [2025-01-10 01:42:50,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:42:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:50,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:42:50,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:50,602 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:50,650 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-01-10 01:42:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-01-10 01:42:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:50,651 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:42:50,652 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:42:50,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:50,653 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:50,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:42:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:42:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-01-10 01:42:50,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 34 [2025-01-10 01:42:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:50,664 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-01-10 01:42:50,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-01-10 01:42:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:42:50,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:50,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:50,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:42:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:50,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:50,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1609595377, now seen corresponding path program 1 times [2025-01-10 01:42:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:50,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005002954] [2025-01-10 01:42:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:50,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:42:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:42:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:42:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005002954] [2025-01-10 01:42:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005002954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680481151] [2025-01-10 01:42:50,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:50,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:50,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:42:50,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:42:50,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:42:50,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:50,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:50,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:42:51,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:42:51,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:42:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680481151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:51,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:51,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-10 01:42:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606132126] [2025-01-10 01:42:51,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:42:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:51,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:42:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:51,132 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:51,160 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-01-10 01:42:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-01-10 01:42:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:51,161 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:42:51,161 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:42:51,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:51,162 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:51,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:42:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-10 01:42:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-01-10 01:42:51,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2025-01-10 01:42:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:51,168 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-01-10 01:42:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:42:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-01-10 01:42:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:42:51,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:51,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:51,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:42:51,374 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,SelfDestructingSolverStorable7 [2025-01-10 01:42:51,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1785479789, now seen corresponding path program 1 times [2025-01-10 01:42:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408154510] [2025-01-10 01:42:51,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:51,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:42:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:42:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:42:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:51,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408154510] [2025-01-10 01:42:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408154510] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:51,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730908980] [2025-01-10 01:42:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:51,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:51,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:42:51,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:42:51,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:42:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:51,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:51,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:42:51,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730908980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:51,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:42:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235556378] [2025-01-10 01:42:51,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:51,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:51,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:51,567 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:51,595 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-10 01:42:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-01-10 01:42:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:51,596 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:42:51,596 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:42:51,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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-01-10 01:42:51,597 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:51,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:42:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:42:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:42:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-01-10 01:42:51,602 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 42 [2025-01-10 01:42:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-01-10 01:42:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-01-10 01:42:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 01:42:51,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:51,603 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:42:51,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:42:51,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:51,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 484701451, now seen corresponding path program 1 times [2025-01-10 01:42:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689382112] [2025-01-10 01:42:51,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:51,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:42:51,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:42:51,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:51,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:42:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689382112] [2025-01-10 01:42:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689382112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126899948] [2025-01-10 01:42:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:51,895 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-01-10 01:42:51,897 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-01-10 01:42:51,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:42:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:42:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:51,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:51,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:42:51,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:42:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126899948] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:52,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:42:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16738768] [2025-01-10 01:42:52,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:42:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:52,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:42:52,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:42:52,059 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 01:42:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:52,129 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-01-10 01:42:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:42:52,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2025-01-10 01:42:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:52,131 INFO L225 Difference]: With dead ends: 69 [2025-01-10 01:42:52,133 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 01:42:52,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 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-01-10 01:42:52,134 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:52,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:42:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 01:42:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 01:42:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:42:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-01-10 01:42:52,145 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 43 [2025-01-10 01:42:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:52,146 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-01-10 01:42:52,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 01:42:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-01-10 01:42:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 01:42:52,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:52,149 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-01-10 01:42:52,157 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-01-10 01:42:52,349 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,SelfDestructingSolverStorable9 [2025-01-10 01:42:52,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:42:52,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1309247833, now seen corresponding path program 2 times [2025-01-10 01:42:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:52,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859520161] [2025-01-10 01:42:52,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:52,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-01-10 01:42:52,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 103 statements. [2025-01-10 01:42:52,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:52,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-10 01:42:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859520161] [2025-01-10 01:42:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859520161] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451384625] [2025-01-10 01:42:52,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:52,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:52,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:42:52,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:42:52,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-01-10 01:42:52,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 103 statements. [2025-01-10 01:42:52,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:52,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:42:52,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-10 01:42:52,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-10 01:42:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451384625] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:52,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 01:42:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331804096] [2025-01-10 01:42:52,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:42:52,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:52,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:42:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:42:52,667 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:52,695 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-01-10 01:42:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:42:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2025-01-10 01:42:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:52,697 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:42:52,697 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:42:52,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:42:52,698 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:52,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:42:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:42:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:42:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:42:52,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-01-10 01:42:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:42:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:42:52,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:42:52,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:42:52,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:42:52,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:42:52,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:42:52,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:42:52,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:42:52,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:42:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:52,912 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:52,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:42:53,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:42:53,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:42:53 BoogieIcfgContainer [2025-01-10 01:42:53,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:42:53,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:42:53,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:42:53,060 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:42:53,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:48" (3/4) ... [2025-01-10 01:42:53,063 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:42:53,068 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:42:53,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:42:53,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:42:53,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:42:53,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:42:53,145 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:42:53,145 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:42:53,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:42:53,146 INFO L158 Benchmark]: Toolchain (without parser) took 5508.90ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 91.6MB in the end (delta: 20.7MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2025-01-10 01:42:53,147 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:53,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:42:53,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.77ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:53,148 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 982.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:53,148 INFO L158 Benchmark]: RCFGBuilder took 256.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 87.8MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:42:53,149 INFO L158 Benchmark]: TraceAbstraction took 4896.51ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 96.6MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:53,149 INFO L158 Benchmark]: Witness Printer took 85.80ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.6MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:42:53,151 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.13ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.77ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 982.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 256.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 87.8MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4896.51ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 96.6MB in the end (delta: -9.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.80ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.6MB in the end (delta: 5.0MB). There was no memory consumed. 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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 2 procedures, 31 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 223 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 544 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=10, InterpolantAutomatonStates: 60, 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, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 672 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 914 ConstructedInterpolants, 0 QuantifiedInterpolants, 2294 SizeOfPredicates, 2 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 1027/1238 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 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((n <= 2147483647) && (x == y)) && (1 <= i)) && (x <= 2147483647)) || ((((n <= 2147483647) && (i == 0)) && (y == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:42:53,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE