./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/nla-digbench-scaling/ps3-ll_unwindbound1.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 6835a6a52b399101fa57284de792210b11ef12afe0f3073436fba94237f48f05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:50:07,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:50:07,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:50:07,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:50:07,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:50:07,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:50:07,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:50:07,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:50:07,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:50:07,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:50:07,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:50:07,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:50:07,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:50:07,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:50:07,160 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:50:07,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:50:07,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:50:07,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:50:07,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:50:07,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:50:07,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:50:07,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:50:07,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:50:07,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:50:07,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:50:07,164 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 -> 6835a6a52b399101fa57284de792210b11ef12afe0f3073436fba94237f48f05 [2025-02-08 09:50:07,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:50:07,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:50:07,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:50:07,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:50:07,478 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:50:07,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound1.c [2025-02-08 09:50:08,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dca90a86/1d562979d63742c68d4cd89a2f8554ea/FLAG3f3663e87 [2025-02-08 09:50:09,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:50:09,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound1.c [2025-02-08 09:50:09,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dca90a86/1d562979d63742c68d4cd89a2f8554ea/FLAG3f3663e87 [2025-02-08 09:50:09,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dca90a86/1d562979d63742c68d4cd89a2f8554ea [2025-02-08 09:50:09,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:50:09,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:50:09,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:50:09,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:50:09,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:50:09,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d0687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09, skipping insertion in model container [2025-02-08 09:50:09,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:50:09,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:50:09,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:50:09,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:50:09,339 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:50:09,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09 WrapperNode [2025-02-08 09:50:09,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:50:09,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:50:09,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:50:09,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:50:09,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,371 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-02-08 09:50:09,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:50:09,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:50:09,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:50:09,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:50:09,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,404 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-02-08 09:50:09,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:50:09,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:50:09,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:50:09,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:50:09,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (1/1) ... [2025-02-08 09:50:09,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:50:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:09,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:50:09,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:50:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:50:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:50:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:50:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:50:09,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:50:09,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:50:09,534 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:50:09,536 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:50:09,923 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-02-08 09:50:09,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:50:09,940 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:50:09,942 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:50:09,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:50:09 BoogieIcfgContainer [2025-02-08 09:50:09,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:50:09,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:50:09,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:50:09,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:50:09,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:50:09" (1/3) ... [2025-02-08 09:50:09,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a129c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:50:09, skipping insertion in model container [2025-02-08 09:50:09,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:50:09" (2/3) ... [2025-02-08 09:50:09,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a129c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:50:09, skipping insertion in model container [2025-02-08 09:50:09,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:50:09" (3/3) ... [2025-02-08 09:50:09,953 INFO L128 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound1.c [2025-02-08 09:50:09,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:50:09,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps3-ll_unwindbound1.c that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 46 error locations. [2025-02-08 09:50:10,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:50:10,022 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;@40a483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:50:10,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 09:50:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 101 states have internal predecessors, (105), 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-02-08 09:50:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 09:50:10,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:10,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 09:50:10,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 130019, now seen corresponding path program 1 times [2025-02-08 09:50:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634454338] [2025-02-08 09:50:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 09:50:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 09:50:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634454338] [2025-02-08 09:50:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634454338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:10,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:50:10,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722015464] [2025-02-08 09:50:10,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:10,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:50:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:10,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:50:10,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:50:10,250 INFO L87 Difference]: Start difference. First operand has 105 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 101 states have internal predecessors, (105), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:10,327 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-02-08 09:50:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:50:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-08 09:50:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:10,334 INFO L225 Difference]: With dead ends: 208 [2025-02-08 09:50:10,335 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 09:50:10,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:50:10,339 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:10,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:50:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 09:50:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 09:50:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.736842105263158) internal successors, (99), 97 states have internal predecessors, (99), 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-02-08 09:50:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-02-08 09:50:10,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 3 [2025-02-08 09:50:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:10,383 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-02-08 09:50:10,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-02-08 09:50:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:50:10,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:10,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:50:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:50:10,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash -421506788, now seen corresponding path program 1 times [2025-02-08 09:50:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-02-08 09:50:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:10,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:50:10,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:50:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972584427] [2025-02-08 09:50:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972584427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137108637] [2025-02-08 09:50:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,447 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:10,521 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2025-02-08 09:50:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:10,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 09:50:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:10,522 INFO L225 Difference]: With dead ends: 100 [2025-02-08 09:50:10,524 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 09:50:10,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,525 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:10,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 66 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 09:50:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 09:50:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 94 states have internal predecessors, (96), 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-02-08 09:50:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2025-02-08 09:50:10,537 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 6 [2025-02-08 09:50:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-02-08 09:50:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2025-02-08 09:50:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 09:50:10,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:10,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:10,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:50:10,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:10,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:10,538 INFO L85 PathProgramCache]: Analyzing trace with hash -181808481, now seen corresponding path program 1 times [2025-02-08 09:50:10,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:10,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-02-08 09:50:10,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 09:50:10,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 09:50:10,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:10,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-02-08 09:50:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14200546] [2025-02-08 09:50:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:10,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:10,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:10,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,580 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:10,688 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2025-02-08 09:50:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:10,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 09:50:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:10,689 INFO L225 Difference]: With dead ends: 166 [2025-02-08 09:50:10,690 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 09:50:10,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,691 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:10,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 125 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 09:50:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2025-02-08 09:50:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 115 states have internal predecessors, (132), 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-02-08 09:50:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2025-02-08 09:50:10,704 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 7 [2025-02-08 09:50:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:10,704 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2025-02-08 09:50:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2025-02-08 09:50:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:50:10,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:10,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:50:10,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1341095558, now seen corresponding path program 1 times [2025-02-08 09:50:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-02-08 09:50:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:50:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:50:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:10,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-02-08 09:50:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941243838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692844629] [2025-02-08 09:50:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:10,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:10,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:10,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,756 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:10,894 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2025-02-08 09:50:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 09:50:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:10,895 INFO L225 Difference]: With dead ends: 119 [2025-02-08 09:50:10,895 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 09:50:10,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,896 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:10,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 29 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 09:50:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-08 09:50:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.564102564102564) internal successors, (122), 108 states have internal predecessors, (122), 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-02-08 09:50:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2025-02-08 09:50:10,903 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 8 [2025-02-08 09:50:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2025-02-08 09:50:10,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2025-02-08 09:50:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 09:50:10,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:10,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:50:10,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:10,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1375710717, now seen corresponding path program 1 times [2025-02-08 09:50:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367039032] [2025-02-08 09:50:10,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:10,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 09:50:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 09:50:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:10,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367039032] [2025-02-08 09:50:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367039032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:10,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394007260] [2025-02-08 09:50:10,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:10,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:10,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:10,937 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:11,074 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2025-02-08 09:50:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-02-08 09:50:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:11,075 INFO L225 Difference]: With dead ends: 141 [2025-02-08 09:50:11,075 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 09:50:11,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:11,076 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:11,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 62 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 09:50:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-02-08 09:50:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5) internal successors, (138), 122 states have internal predecessors, (138), 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-02-08 09:50:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2025-02-08 09:50:11,088 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 9 [2025-02-08 09:50:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:11,088 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2025-02-08 09:50:11,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2025-02-08 09:50:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:50:11,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:11,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:11,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:50:11,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash -791926437, now seen corresponding path program 1 times [2025-02-08 09:50:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-02-08 09:50:11,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:50:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:50:11,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:11,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:11,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780058125] [2025-02-08 09:50:11,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:11,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:11,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:11,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:11,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:50:11,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:50:11,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:50:11,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:11,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:11,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:50:11,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:11,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-02-08 09:50:11,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780058125] [2025-02-08 09:50:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780058125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:11,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:11,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87074706] [2025-02-08 09:50:11,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:11,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:11,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:11,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:11,185 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:11,310 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-02-08 09:50:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-02-08 09:50:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:11,311 INFO L225 Difference]: With dead ends: 138 [2025-02-08 09:50:11,312 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 09:50:11,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:11,314 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:11,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 09:50:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2025-02-08 09:50:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 124 states have internal predecessors, (137), 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-02-08 09:50:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2025-02-08 09:50:11,325 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 11 [2025-02-08 09:50:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:11,325 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2025-02-08 09:50:11,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2025-02-08 09:50:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 09:50:11,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:11,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:11,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:50:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:11,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -25079148, now seen corresponding path program 1 times [2025-02-08 09:50:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-02-08 09:50:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:11,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 09:50:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 09:50:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-02-08 09:50:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487326396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:50:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708554308] [2025-02-08 09:50:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:11,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:50:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:50:11,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:50:11,596 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:11,774 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2025-02-08 09:50:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:50:11,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-08 09:50:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:11,775 INFO L225 Difference]: With dead ends: 136 [2025-02-08 09:50:11,775 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 09:50:11,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:50:11,776 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 43 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:50:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 09:50:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-02-08 09:50:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 122 states have internal predecessors, (133), 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-02-08 09:50:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-02-08 09:50:11,784 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 14 [2025-02-08 09:50:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-02-08 09:50:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-02-08 09:50:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 09:50:11,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:11,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:11,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:50:11,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -777453545, now seen corresponding path program 1 times [2025-02-08 09:50:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937627445] [2025-02-08 09:50:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:11,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 09:50:11,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 09:50:11,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:11,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676444636] [2025-02-08 09:50:11,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:11,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:11,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:11,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:11,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:50:11,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 09:50:11,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 09:50:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:11,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:50:11,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:11,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937627445] [2025-02-08 09:50:11,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676444636] [2025-02-08 09:50:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676444636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635900195] [2025-02-08 09:50:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:11,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:11,916 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:12,044 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2025-02-08 09:50:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 09:50:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:12,045 INFO L225 Difference]: With dead ends: 138 [2025-02-08 09:50:12,045 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 09:50:12,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:12,046 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:12,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 62 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 09:50:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-02-08 09:50:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 125 states have internal predecessors, (133), 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-02-08 09:50:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2025-02-08 09:50:12,056 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 15 [2025-02-08 09:50:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2025-02-08 09:50:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2025-02-08 09:50:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 09:50:12,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:12,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:12,064 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-02-08 09:50:12,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:12,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -108362834, now seen corresponding path program 1 times [2025-02-08 09:50:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048522366] [2025-02-08 09:50:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:12,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 09:50:12,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 09:50:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430952847] [2025-02-08 09:50:12,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:12,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:12,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:12,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:50:12,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 09:50:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 09:50:12,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:12,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:12,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:50:12,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:12,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048522366] [2025-02-08 09:50:12,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430952847] [2025-02-08 09:50:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430952847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:50:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214123188] [2025-02-08 09:50:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:12,428 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:12,551 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2025-02-08 09:50:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2025-02-08 09:50:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:12,553 INFO L225 Difference]: With dead ends: 135 [2025-02-08 09:50:12,553 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 09:50:12,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:12,553 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:12,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 09:50:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-02-08 09:50:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.4) internal successors, (112), 108 states have internal predecessors, (112), 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-02-08 09:50:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2025-02-08 09:50:12,560 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 20 [2025-02-08 09:50:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:12,561 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2025-02-08 09:50:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2025-02-08 09:50:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 09:50:12,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:12,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:12,569 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-02-08 09:50:12,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:12,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2090306080, now seen corresponding path program 1 times [2025-02-08 09:50:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-02-08 09:50:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 09:50:12,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 09:50:12,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:12,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035733065] [2025-02-08 09:50:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035733065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:50:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093223871] [2025-02-08 09:50:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:50:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:12,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:50:12,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:12,851 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-02-08 09:50:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:12,867 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2025-02-08 09:50:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:50:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2025-02-08 09:50:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:12,868 INFO L225 Difference]: With dead ends: 114 [2025-02-08 09:50:12,868 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 09:50:12,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:50:12,869 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:12,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:50:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 09:50:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-08 09:50:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.375) internal successors, (110), 108 states have internal predecessors, (110), 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-02-08 09:50:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2025-02-08 09:50:12,873 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 30 [2025-02-08 09:50:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:12,874 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2025-02-08 09:50:12,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-02-08 09:50:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2025-02-08 09:50:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 09:50:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:12,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 09:50:12,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2118913136, now seen corresponding path program 1 times [2025-02-08 09:50:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174430960] [2025-02-08 09:50:12,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:12,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 09:50:12,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:50:12,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:12,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559689891] [2025-02-08 09:50:12,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:12,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:12,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:50:12,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 09:50:12,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:50:12,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:12,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:12,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:50:12,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:13,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174430960] [2025-02-08 09:50:13,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559689891] [2025-02-08 09:50:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559689891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:50:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744082266] [2025-02-08 09:50:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:50:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:13,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:50:13,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:50:13,008 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-02-08 09:50:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:13,168 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2025-02-08 09:50:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:50:13,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 35 [2025-02-08 09:50:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:13,169 INFO L225 Difference]: With dead ends: 180 [2025-02-08 09:50:13,169 INFO L226 Difference]: Without dead ends: 168 [2025-02-08 09:50:13,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:50:13,171 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:13,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 96 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:50:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-08 09:50:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2025-02-08 09:50:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.36) internal successors, (170), 153 states have internal predecessors, (170), 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-02-08 09:50:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2025-02-08 09:50:13,178 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 35 [2025-02-08 09:50:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:13,178 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2025-02-08 09:50:13,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-02-08 09:50:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2025-02-08 09:50:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 09:50:13,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:13,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:13,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:13,381 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,SelfDestructingSolverStorable10 [2025-02-08 09:50:13,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:13,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash 461025710, now seen corresponding path program 1 times [2025-02-08 09:50:13,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:13,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-02-08 09:50:13,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:13,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 09:50:13,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 09:50:13,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:13,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-02-08 09:50:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271068169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:50:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918769907] [2025-02-08 09:50:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:13,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:50:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:13,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:50:13,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:50:13,439 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-02-08 09:50:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:13,561 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2025-02-08 09:50:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:50:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 37 [2025-02-08 09:50:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:13,563 INFO L225 Difference]: With dead ends: 159 [2025-02-08 09:50:13,563 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 09:50:13,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:50:13,563 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:13,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 09:50:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 09:50:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.352) internal successors, (169), 153 states have internal predecessors, (169), 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-02-08 09:50:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-02-08 09:50:13,569 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 37 [2025-02-08 09:50:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:13,569 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-02-08 09:50:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-02-08 09:50:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-02-08 09:50:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 09:50:13,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:13,570 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:13,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 09:50:13,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 664078028, now seen corresponding path program 1 times [2025-02-08 09:50:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831665380] [2025-02-08 09:50:13,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 09:50:13,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 09:50:13,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:13,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831665380] [2025-02-08 09:50:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831665380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:50:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839179127] [2025-02-08 09:50:13,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:13,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:13,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:50:13,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 09:50:13,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 09:50:13,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:13,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:13,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:50:13,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:13,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839179127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:50:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-08 09:50:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823454677] [2025-02-08 09:50:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:50:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:13,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:50:13,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:50:13,791 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-02-08 09:50:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:13,817 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2025-02-08 09:50:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:50:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 39 [2025-02-08 09:50:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:13,818 INFO L225 Difference]: With dead ends: 158 [2025-02-08 09:50:13,818 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 09:50:13,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:50:13,820 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 51 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 232 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-02-08 09:50:13,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 232 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:50:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 09:50:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-08 09:50:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.336) internal successors, (167), 152 states have internal predecessors, (167), 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-02-08 09:50:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2025-02-08 09:50:13,828 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 39 [2025-02-08 09:50:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:13,828 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2025-02-08 09:50:13,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-02-08 09:50:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2025-02-08 09:50:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 09:50:13,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:13,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:13,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 09:50:14,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -888417547, now seen corresponding path program 1 times [2025-02-08 09:50:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827814858] [2025-02-08 09:50:14,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:14,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 09:50:14,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 09:50:14,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:14,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827814858] [2025-02-08 09:50:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827814858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:50:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412855371] [2025-02-08 09:50:14,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:14,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:14,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 09:50:14,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 09:50:14,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 09:50:14,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:14,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:50:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:14,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412855371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:50:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-08 09:50:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149485633] [2025-02-08 09:50:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:50:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:14,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:50:14,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:50:14,227 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-02-08 09:50:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:14,266 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2025-02-08 09:50:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:50:14,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 40 [2025-02-08 09:50:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:14,270 INFO L225 Difference]: With dead ends: 200 [2025-02-08 09:50:14,270 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 09:50:14,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:50:14,271 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:14,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 342 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:50:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 09:50:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 156. [2025-02-08 09:50:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 125 states have (on average 1.32) internal successors, (165), 151 states have internal predecessors, (165), 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-02-08 09:50:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2025-02-08 09:50:14,279 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 40 [2025-02-08 09:50:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:14,279 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2025-02-08 09:50:14,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-02-08 09:50:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2025-02-08 09:50:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 09:50:14,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:14,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:14,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:14,480 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,SelfDestructingSolverStorable13 [2025-02-08 09:50:14,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1258602232, now seen corresponding path program 1 times [2025-02-08 09:50:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:14,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-02-08 09:50:14,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:14,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:50:14,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:50:14,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:14,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-02-08 09:50:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550704074] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:50:14,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940442693] [2025-02-08 09:50:14,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:14,587 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-02-08 09:50:14,595 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-02-08 09:50:14,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:50:14,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:50:14,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:14,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:14,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:50:14,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:14,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:50:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940442693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:50:14,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:50:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-02-08 09:50:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108349759] [2025-02-08 09:50:14,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:50:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:50:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:14,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:50:14,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:50:14,775 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:50:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:14,820 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2025-02-08 09:50:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:50:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-08 09:50:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:14,822 INFO L225 Difference]: With dead ends: 184 [2025-02-08 09:50:14,822 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 09:50:14,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:50:14,824 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:14,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 274 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:50:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 09:50:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 09:50:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.087719298245614) internal successors, (62), 62 states have internal predecessors, (62), 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-02-08 09:50:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 64 transitions. [2025-02-08 09:50:14,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 64 transitions. Word has length 43 [2025-02-08 09:50:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:14,832 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 64 transitions. [2025-02-08 09:50:14,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:50:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 64 transitions. [2025-02-08 09:50:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 09:50:14,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:14,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:14,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:15,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:15,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:15,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1258603031, now seen corresponding path program 1 times [2025-02-08 09:50:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727986735] [2025-02-08 09:50:15,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:15,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:50:15,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:50:15,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:15,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872027534] [2025-02-08 09:50:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:15,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:15,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:15,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 09:50:15,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:50:15,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:50:15,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:15,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:15,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:50:15,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:15,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:50:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727986735] [2025-02-08 09:50:15,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872027534] [2025-02-08 09:50:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872027534] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:50:15,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:50:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 09:50:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579304753] [2025-02-08 09:50:15,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:50:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:50:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:50:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:50:15,331 INFO L87 Difference]: Start difference. First operand 65 states and 64 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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-02-08 09:50:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:15,455 INFO L93 Difference]: Finished difference Result 65 states and 64 transitions. [2025-02-08 09:50:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:50:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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 43 [2025-02-08 09:50:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:15,456 INFO L225 Difference]: With dead ends: 65 [2025-02-08 09:50:15,456 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 09:50:15,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:50:15,457 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:15,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 51 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 09:50:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 09:50:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 61 states have internal predecessors, (61), 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-02-08 09:50:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2025-02-08 09:50:15,463 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 43 [2025-02-08 09:50:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:15,463 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2025-02-08 09:50:15,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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-02-08 09:50:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2025-02-08 09:50:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 09:50:15,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:15,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:15,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:15,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 09:50:15,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2025-02-08 09:50:15,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1764444703, now seen corresponding path program 1 times [2025-02-08 09:50:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437544542] [2025-02-08 09:50:15,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:15,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 09:50:15,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 09:50:15,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:15,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242048151] [2025-02-08 09:50:15,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:50:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:15,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:50:15,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 09:50:15,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 09:50:15,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 09:50:15,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:50:15,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:15,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:50:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:15,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:50:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:50:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437544542] [2025-02-08 09:50:16,022 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242048151] [2025-02-08 09:50:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242048151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:50:16,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:50:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 09:50:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400860130] [2025-02-08 09:50:16,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:50:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:50:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:50:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:50:16,024 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 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-02-08 09:50:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:16,105 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2025-02-08 09:50:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:50:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 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 51 [2025-02-08 09:50:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:16,106 INFO L225 Difference]: With dead ends: 64 [2025-02-08 09:50:16,107 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:50:16,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:50:16,107 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:16,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 51 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:50:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:50:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:50:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:50:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:50:16,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-02-08 09:50:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:16,109 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:50:16,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 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-02-08 09:50:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:50:16,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:50:16,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2025-02-08 09:50:16,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2025-02-08 09:50:16,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2025-02-08 09:50:16,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2025-02-08 09:50:16,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:16,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:16,317 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:16,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:50:16,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:50:16,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:50:16 BoogieIcfgContainer [2025-02-08 09:50:16,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:50:16,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:50:16,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:50:16,364 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:50:16,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:50:09" (3/4) ... [2025-02-08 09:50:16,366 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:50:16,370 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 09:50:16,374 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 09:50:16,374 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:50:16,374 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:50:16,374 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:50:16,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:50:16,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:50:16,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:50:16,443 INFO L158 Benchmark]: Toolchain (without parser) took 7294.91ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 51.5MB in the end (delta: 55.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-02-08 09:50:16,443 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:16,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.05ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:50:16,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.16ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:16,443 INFO L158 Benchmark]: Boogie Preprocessor took 43.37ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:50:16,443 INFO L158 Benchmark]: IcfgBuilder took 522.52ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:50:16,444 INFO L158 Benchmark]: TraceAbstraction took 6418.12ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 58.1MB in the end (delta: 15.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2025-02-08 09:50:16,444 INFO L158 Benchmark]: Witness Printer took 78.50ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:16,445 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.68ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.05ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.16ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.37ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 522.52ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6418.12ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 58.1MB in the end (delta: 15.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Witness Printer took 78.50ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.6MB). 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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, 105 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 719 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 711 mSDsluCounter, 2150 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1233 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1416 IncrementalHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 917 mSDtfsCounter, 1416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 403 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=11, InterpolantAutomatonStates: 67, 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, 17 MinimizatonAttempts, 124 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 3046 SizeOfPredicates, 7 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 17/44 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 46 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((c == 0) && (y == 0)) && (counter == 0)) && (x == 0)) || (((x == 1) && (y == 1)) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:50:16,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE