./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label45.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:40:04,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:40:04,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:40:04,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:40:04,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:40:04,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:40:04,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:40:04,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:40:04,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:40:04,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:40:04,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:40:04,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:40:04,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:40:04,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:40:04,332 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:40:04,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:40:04,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:40:04,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:40:04,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:04,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:04,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:40:04,334 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 ! call(reach_error())) ) 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 -> 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e [2025-01-08 23:40:04,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:40:04,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:40:04,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:40:04,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:40:04,622 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:40:04,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2025-01-08 23:40:05,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3342ac3a8/c5ecbb63ac72498887c63438a166a622/FLAG2bd154e76 [2025-01-08 23:40:06,153 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:40:06,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2025-01-08 23:40:06,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3342ac3a8/c5ecbb63ac72498887c63438a166a622/FLAG2bd154e76 [2025-01-08 23:40:06,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3342ac3a8/c5ecbb63ac72498887c63438a166a622 [2025-01-08 23:40:06,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:40:06,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:40:06,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:06,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:40:06,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:40:06,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dc6e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06, skipping insertion in model container [2025-01-08 23:40:06,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:40:06,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2025-01-08 23:40:06,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:06,725 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:40:06,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2025-01-08 23:40:06,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:06,802 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:40:06,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06 WrapperNode [2025-01-08 23:40:06,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:06,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:06,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:40:06,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:40:06,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,879 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:40:06,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:06,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:40:06,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:40:06,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:40:06,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:40:06,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:40:06,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:40:06,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:40:06,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:40:06,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (1/1) ... [2025-01-08 23:40:06,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:06,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:07,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:40:07,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:40:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:40:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:40:07,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:40:07,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:40:07,060 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:40:07,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:40:07,880 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:40:07,880 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:40:07,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:40:07,895 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:40:07,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:07 BoogieIcfgContainer [2025-01-08 23:40:07,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:40:07,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:40:07,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:40:07,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:40:07,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:40:06" (1/3) ... [2025-01-08 23:40:07,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a601d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:07, skipping insertion in model container [2025-01-08 23:40:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:06" (2/3) ... [2025-01-08 23:40:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a601d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:07, skipping insertion in model container [2025-01-08 23:40:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:07" (3/3) ... [2025-01-08 23:40:07,905 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2025-01-08 23:40:07,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:40:07,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label45.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:40:07,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:40:07,974 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;@453415c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:40:07,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:40:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 23:40:07,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:07,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:07,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1878469622, now seen corresponding path program 1 times [2025-01-08 23:40:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:07,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838889386] [2025-01-08 23:40:07,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-08 23:40:08,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 23:40:08,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:08,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838889386] [2025-01-08 23:40:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838889386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:08,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477345925] [2025-01-08 23:40:08,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:08,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:08,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:08,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:08,303 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:09,194 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-01-08 23:40:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2025-01-08 23:40:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:09,203 INFO L225 Difference]: With dead ends: 567 [2025-01-08 23:40:09,204 INFO L226 Difference]: Without dead ends: 282 [2025-01-08 23:40:09,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:09,208 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:40:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-08 23:40:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-08 23:40:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2025-01-08 23:40:09,255 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 38 [2025-01-08 23:40:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:09,255 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2025-01-08 23:40:09,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2025-01-08 23:40:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-08 23:40:09,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:09,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:09,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:40:09,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1310975884, now seen corresponding path program 1 times [2025-01-08 23:40:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207529878] [2025-01-08 23:40:09,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:09,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-08 23:40:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-08 23:40:09,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207529878] [2025-01-08 23:40:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207529878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819648954] [2025-01-08 23:40:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:09,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:09,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:09,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:09,428 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:09,916 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2025-01-08 23:40:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2025-01-08 23:40:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:09,922 INFO L225 Difference]: With dead ends: 840 [2025-01-08 23:40:09,922 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:40:09,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:09,924 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:09,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:40:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:40:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2025-01-08 23:40:09,947 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 108 [2025-01-08 23:40:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2025-01-08 23:40:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2025-01-08 23:40:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-08 23:40:09,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:09,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:40:09,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 24860703, now seen corresponding path program 1 times [2025-01-08 23:40:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033568340] [2025-01-08 23:40:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:09,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-08 23:40:09,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-08 23:40:09,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:09,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033568340] [2025-01-08 23:40:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033568340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:10,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126358531] [2025-01-08 23:40:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:10,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:10,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:10,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:10,385 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:10,963 INFO L93 Difference]: Finished difference Result 1554 states and 2010 transitions. [2025-01-08 23:40:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:10,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-01-08 23:40:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:10,969 INFO L225 Difference]: With dead ends: 1554 [2025-01-08 23:40:10,969 INFO L226 Difference]: Without dead ends: 977 [2025-01-08 23:40:10,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:10,970 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:10,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 53 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-08 23:40:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-01-08 23:40:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.290983606557377) internal successors, (1260), 976 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1260 transitions. [2025-01-08 23:40:10,997 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1260 transitions. Word has length 113 [2025-01-08 23:40:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:10,997 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1260 transitions. [2025-01-08 23:40:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1260 transitions. [2025-01-08 23:40:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-08 23:40:11,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:11,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:11,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:40:11,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:11,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash -301138185, now seen corresponding path program 1 times [2025-01-08 23:40:11,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:11,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877768470] [2025-01-08 23:40:11,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:11,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-08 23:40:11,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-08 23:40:11,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:11,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:11,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:11,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877768470] [2025-01-08 23:40:11,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877768470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:11,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:11,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682762732] [2025-01-08 23:40:11,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:11,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:11,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:11,208 INFO L87 Difference]: Start difference. First operand 977 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:11,646 INFO L93 Difference]: Finished difference Result 2508 states and 3301 transitions. [2025-01-08 23:40:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2025-01-08 23:40:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:11,651 INFO L225 Difference]: With dead ends: 2508 [2025-01-08 23:40:11,652 INFO L226 Difference]: Without dead ends: 1672 [2025-01-08 23:40:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:11,654 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:11,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-08 23:40:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1394. [2025-01-08 23:40:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2914572864321607) internal successors, (1799), 1393 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1799 transitions. [2025-01-08 23:40:11,676 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1799 transitions. Word has length 129 [2025-01-08 23:40:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:11,677 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1799 transitions. [2025-01-08 23:40:11,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1799 transitions. [2025-01-08 23:40:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-08 23:40:11,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:11,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:11,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:40:11,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:11,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 667802005, now seen corresponding path program 1 times [2025-01-08 23:40:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:11,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792695982] [2025-01-08 23:40:11,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:11,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-08 23:40:11,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-08 23:40:11,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:11,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792695982] [2025-01-08 23:40:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792695982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695874267] [2025-01-08 23:40:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:11,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:11,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:11,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:11,846 INFO L87 Difference]: Start difference. First operand 1394 states and 1799 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:12,184 INFO L93 Difference]: Finished difference Result 2925 states and 3744 transitions. [2025-01-08 23:40:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130 [2025-01-08 23:40:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:12,191 INFO L225 Difference]: With dead ends: 2925 [2025-01-08 23:40:12,191 INFO L226 Difference]: Without dead ends: 1533 [2025-01-08 23:40:12,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:12,194 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:12,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 83 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-01-08 23:40:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2025-01-08 23:40:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.2676240208877285) internal successors, (1942), 1532 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1942 transitions. [2025-01-08 23:40:12,221 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1942 transitions. Word has length 130 [2025-01-08 23:40:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:12,222 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1942 transitions. [2025-01-08 23:40:12,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1942 transitions. [2025-01-08 23:40:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 23:40:12,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:12,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:12,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:40:12,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1154262917, now seen corresponding path program 1 times [2025-01-08 23:40:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408373097] [2025-01-08 23:40:12,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:12,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 23:40:12,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 23:40:12,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:12,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408373097] [2025-01-08 23:40:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408373097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14313239] [2025-01-08 23:40:12,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:12,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:12,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:12,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:40:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 23:40:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 23:40:12,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:12,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:40:12,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 23:40:12,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14313239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:40:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732750976] [2025-01-08 23:40:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:12,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:12,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:12,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:40:12,736 INFO L87 Difference]: Start difference. First operand 1533 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:13,116 INFO L93 Difference]: Finished difference Result 2230 states and 2798 transitions. [2025-01-08 23:40:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:13,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 149 [2025-01-08 23:40:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:13,123 INFO L225 Difference]: With dead ends: 2230 [2025-01-08 23:40:13,123 INFO L226 Difference]: Without dead ends: 2228 [2025-01-08 23:40:13,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:40:13,124 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:13,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 11 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-01-08 23:40:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2025-01-08 23:40:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.280110497237569) internal successors, (2317), 1810 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2317 transitions. [2025-01-08 23:40:13,156 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2317 transitions. Word has length 149 [2025-01-08 23:40:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:13,156 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2317 transitions. [2025-01-08 23:40:13,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2317 transitions. [2025-01-08 23:40:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-08 23:40:13,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:13,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:13,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:40:13,362 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-01-08 23:40:13,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2105929363, now seen corresponding path program 1 times [2025-01-08 23:40:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787059690] [2025-01-08 23:40:13,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:13,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-08 23:40:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-08 23:40:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787059690] [2025-01-08 23:40:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787059690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:13,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660542383] [2025-01-08 23:40:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:13,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:13,500 INFO L87 Difference]: Start difference. First operand 1811 states and 2317 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:13,895 INFO L93 Difference]: Finished difference Result 4037 states and 5235 transitions. [2025-01-08 23:40:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2025-01-08 23:40:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:13,901 INFO L225 Difference]: With dead ends: 4037 [2025-01-08 23:40:13,902 INFO L226 Difference]: Without dead ends: 2367 [2025-01-08 23:40:13,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:13,904 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:13,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-01-08 23:40:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1950. [2025-01-08 23:40:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.2601334017444843) internal successors, (2456), 1949 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2456 transitions. [2025-01-08 23:40:13,935 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2456 transitions. Word has length 179 [2025-01-08 23:40:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2456 transitions. [2025-01-08 23:40:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2456 transitions. [2025-01-08 23:40:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 23:40:13,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:13,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:13,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:40:13,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1629556045, now seen corresponding path program 1 times [2025-01-08 23:40:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981629619] [2025-01-08 23:40:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 23:40:13,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 23:40:13,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:13,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981629619] [2025-01-08 23:40:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981629619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252853287] [2025-01-08 23:40:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:14,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:14,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:14,066 INFO L87 Difference]: Start difference. First operand 1950 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:14,438 INFO L93 Difference]: Finished difference Result 4315 states and 5513 transitions. [2025-01-08 23:40:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:14,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 227 [2025-01-08 23:40:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:14,444 INFO L225 Difference]: With dead ends: 4315 [2025-01-08 23:40:14,445 INFO L226 Difference]: Without dead ends: 2506 [2025-01-08 23:40:14,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:14,447 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:14,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 189 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-01-08 23:40:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2025-01-08 23:40:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.1791647956892681) internal successors, (2626), 2227 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2626 transitions. [2025-01-08 23:40:14,494 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2626 transitions. Word has length 227 [2025-01-08 23:40:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2626 transitions. [2025-01-08 23:40:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2626 transitions. [2025-01-08 23:40:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-08 23:40:14,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:14,498 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:14,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:40:14,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:14,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1718047535, now seen corresponding path program 1 times [2025-01-08 23:40:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520738588] [2025-01-08 23:40:14,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:14,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-08 23:40:14,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-08 23:40:14,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:14,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520738588] [2025-01-08 23:40:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520738588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380403016] [2025-01-08 23:40:15,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:15,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:15,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:40:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-08 23:40:15,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-08 23:40:15,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:15,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 23:40:15,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:40:16,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:40:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:40:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380403016] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:40:17,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:40:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-08 23:40:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867485562] [2025-01-08 23:40:17,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:40:17,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 23:40:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:17,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 23:40:17,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:40:17,449 INFO L87 Difference]: Start difference. First operand 2228 states and 2626 transitions. Second operand has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:20,768 INFO L93 Difference]: Finished difference Result 8965 states and 10555 transitions. [2025-01-08 23:40:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-08 23:40:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 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 261 [2025-01-08 23:40:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:20,783 INFO L225 Difference]: With dead ends: 8965 [2025-01-08 23:40:20,783 INFO L226 Difference]: Without dead ends: 6878 [2025-01-08 23:40:20,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2025-01-08 23:40:20,786 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2250 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:20,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 82 Invalid, 4366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 3731 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:40:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2025-01-08 23:40:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 2923. [2025-01-08 23:40:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2922 states have (on average 1.158795345653662) internal successors, (3386), 2922 states have internal predecessors, (3386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3386 transitions. [2025-01-08 23:40:20,839 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3386 transitions. Word has length 261 [2025-01-08 23:40:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 2923 states and 3386 transitions. [2025-01-08 23:40:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3386 transitions. [2025-01-08 23:40:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-08 23:40:20,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:20,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:40:20,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:40:21,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:21,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:21,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 690029449, now seen corresponding path program 1 times [2025-01-08 23:40:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007998753] [2025-01-08 23:40:21,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-08 23:40:21,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-08 23:40:21,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:21,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007998753] [2025-01-08 23:40:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007998753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720922774] [2025-01-08 23:40:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:21,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:21,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:40:21,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-08 23:40:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-08 23:40:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:21,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:40:21,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:40:21,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720922774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:21,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-08 23:40:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917651400] [2025-01-08 23:40:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:21,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:21,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:21,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:21,609 INFO L87 Difference]: Start difference. First operand 2923 states and 3386 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:22,021 INFO L93 Difference]: Finished difference Result 6261 states and 7348 transitions. [2025-01-08 23:40:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:22,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 286 [2025-01-08 23:40:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:22,030 INFO L225 Difference]: With dead ends: 6261 [2025-01-08 23:40:22,031 INFO L226 Difference]: Without dead ends: 3479 [2025-01-08 23:40:22,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:22,034 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 106 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:22,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 221 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2025-01-08 23:40:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3062. [2025-01-08 23:40:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3061 states have (on average 1.1303495589676575) internal successors, (3460), 3061 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 3460 transitions. [2025-01-08 23:40:22,077 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 3460 transitions. Word has length 286 [2025-01-08 23:40:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:22,077 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 3460 transitions. [2025-01-08 23:40:22,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 3460 transitions. [2025-01-08 23:40:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-08 23:40:22,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:22,082 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:22,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:40:22,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:22,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:22,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash -947625346, now seen corresponding path program 1 times [2025-01-08 23:40:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:22,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72421518] [2025-01-08 23:40:22,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:22,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-08 23:40:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-08 23:40:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-01-08 23:40:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72421518] [2025-01-08 23:40:22,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72421518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:22,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:22,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457116576] [2025-01-08 23:40:22,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:22,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:22,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:22,450 INFO L87 Difference]: Start difference. First operand 3062 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:22,835 INFO L93 Difference]: Finished difference Result 6537 states and 7370 transitions. [2025-01-08 23:40:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:22,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 319 [2025-01-08 23:40:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:22,836 INFO L225 Difference]: With dead ends: 6537 [2025-01-08 23:40:22,836 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:40:22,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:22,840 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:22,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 223 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:40:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:40:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:40:22,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2025-01-08 23:40:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:22,842 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:40:22,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:40:22,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:40:22,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:40:22,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:40:22,849 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:22,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:40:23,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:40:23,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:40:23 BoogieIcfgContainer [2025-01-08 23:40:23,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:40:23,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:40:23,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:40:23,581 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:40:23,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:07" (3/4) ... [2025-01-08 23:40:23,585 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:40:23,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:40:23,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:40:23,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:40:23,612 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:40:23,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:40:23,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:40:23,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:40:23,747 INFO L158 Benchmark]: Toolchain (without parser) took 17391.51ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 103.6MB in the beginning and 369.7MB in the end (delta: -266.2MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,748 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:40:23,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.64ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 77.3MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.80ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 69.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,748 INFO L158 Benchmark]: Boogie Preprocessor took 66.67ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 59.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,749 INFO L158 Benchmark]: RCFGBuilder took 948.22ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 98.1MB in the end (delta: -38.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,750 INFO L158 Benchmark]: TraceAbstraction took 15682.69ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 97.2MB in the beginning and 382.1MB in the end (delta: -284.9MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,750 INFO L158 Benchmark]: Witness Printer took 166.04ms. Allocated memory is still 486.5MB. Free memory was 382.1MB in the beginning and 369.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:23,751 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.64ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 77.3MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.80ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 69.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.67ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 59.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 948.22ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 98.1MB in the end (delta: -38.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15682.69ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 97.2MB in the beginning and 382.1MB in the end (delta: -284.9MB). Peak memory consumption was 280.1MB. Max. memory is 16.1GB. * Witness Printer took 166.04ms. Allocated memory is still 486.5MB. Free memory was 382.1MB in the beginning and 369.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3103 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3103 mSDsluCounter, 1244 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 1251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7650 IncrementalHoareTripleChecker+Invalid, 8901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1251 mSolverCounterUnsat, 1125 mSDtfsCounter, 7650 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1000 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3062occurred in iteration=10, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 5762 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2635 NumberOfCodeBlocks, 2635 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2881 ConstructedInterpolants, 0 QuantifiedInterpolants, 15146 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 1678/2145 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 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((((((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (4 <= a10)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) || (((a10 <= 0) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 1) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (9 <= a19))) || ((((a19 == 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a10 == 2))) || ((((a19 == 9) && (14 == a4)) && (a12 == 0)) && (23 <= a1))) || ((((a10 == 0) && (a19 == 9)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (a1 <= 23)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || (((0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a19 <= 7))) || ((((a19 <= 9) && (219 <= a1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:40:23,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE