./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label18.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/Problem11_label18.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 4f044d45d593d0c657bb6e4150ce9a34551ac2fa936f3d19e30c2549cad74ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:41:23,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:41:23,111 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:41:23,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:41:23,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:41:23,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:41:23,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:41:23,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:41:23,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:41:23,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:41:23,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:41:23,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:41:23,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:41:23,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:41:23,150 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:41:23,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:41:23,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:41:23,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:41:23,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:41:23,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:23,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:23,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:23,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:23,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:41:23,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:23,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:41:23,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:41:23,154 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 -> 4f044d45d593d0c657bb6e4150ce9a34551ac2fa936f3d19e30c2549cad74ba3 [2025-01-08 23:41:23,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:41:23,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:41:23,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:41:23,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:41:23,375 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:41:23,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label18.c [2025-01-08 23:41:24,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ecac6e62/e721190fc40c41ad9a8d0d8bc4b186ea/FLAG314153707 [2025-01-08 23:41:24,769 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:41:24,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label18.c [2025-01-08 23:41:24,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ecac6e62/e721190fc40c41ad9a8d0d8bc4b186ea/FLAG314153707 [2025-01-08 23:41:25,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ecac6e62/e721190fc40c41ad9a8d0d8bc4b186ea [2025-01-08 23:41:25,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:41:25,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:41:25,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:25,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:41:25,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:41:25,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25, skipping insertion in model container [2025-01-08 23:41:25,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:41:25,206 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/Problem11_label18.c[4971,4984] [2025-01-08 23:41:25,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:25,420 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:41:25,440 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/Problem11_label18.c[4971,4984] [2025-01-08 23:41:25,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:25,540 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:41:25,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25 WrapperNode [2025-01-08 23:41:25,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:25,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:25,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:41:25,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:41:25,545 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:41:25" (1/1) ... [2025-01-08 23:41:25,559 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:41:25" (1/1) ... [2025-01-08 23:41:25,617 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:41:25,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:25,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:41:25,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:41:25,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:41:25,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,676 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:41:25,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:41:25,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:41:25,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:41:25,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:41:25,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (1/1) ... [2025-01-08 23:41:25,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:25,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:25,808 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:41:25,812 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:41:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:41:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:41:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:41:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:41:25,873 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:41:25,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:41:27,048 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:41:27,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:41:27,059 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:41:27,059 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:41:27,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:27 BoogieIcfgContainer [2025-01-08 23:41:27,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:41:27,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:41:27,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:41:27,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:41:27,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:41:25" (1/3) ... [2025-01-08 23:41:27,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad69dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:27, skipping insertion in model container [2025-01-08 23:41:27,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:25" (2/3) ... [2025-01-08 23:41:27,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad69dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:27, skipping insertion in model container [2025-01-08 23:41:27,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:27" (3/3) ... [2025-01-08 23:41:27,066 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label18.c [2025-01-08 23:41:27,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:41:27,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label18.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:41:27,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:41:27,118 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;@312715d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:41:27,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:41:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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:41:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 23:41:27,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:27,126 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] [2025-01-08 23:41:27,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1410235526, now seen corresponding path program 1 times [2025-01-08 23:41:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:27,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100060583] [2025-01-08 23:41:27,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:27,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 23:41:27,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 23:41:27,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:27,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:27,367 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:41:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100060583] [2025-01-08 23:41:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100060583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114417479] [2025-01-08 23:41:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:27,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:27,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:27,384 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:28,233 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-01-08 23:41:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-08 23:41:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:28,241 INFO L225 Difference]: With dead ends: 769 [2025-01-08 23:41:28,241 INFO L226 Difference]: Without dead ends: 422 [2025-01-08 23:41:28,243 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:41:28,245 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 206 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:28,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-08 23:41:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-01-08 23:41:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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:41:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-01-08 23:41:28,289 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 34 [2025-01-08 23:41:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:28,289 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-01-08 23:41:28,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-01-08 23:41:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:41:28,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:28,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:41:28,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:28,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -192501481, now seen corresponding path program 1 times [2025-01-08 23:41:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715639852] [2025-01-08 23:41:28,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:28,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:41:28,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:41:28,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:28,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715639852] [2025-01-08 23:41:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715639852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:28,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:28,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:28,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287920425] [2025-01-08 23:41:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:28,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:28,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:28,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:28,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:28,510 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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:41:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:29,180 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-01-08 23:41:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2025-01-08 23:41:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:29,183 INFO L225 Difference]: With dead ends: 1199 [2025-01-08 23:41:29,183 INFO L226 Difference]: Without dead ends: 789 [2025-01-08 23:41:29,184 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:41:29,185 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:29,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-08 23:41:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-01-08 23:41:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 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:41:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:41:29,214 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 100 [2025-01-08 23:41:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:29,214 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:41:29,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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:41:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:41:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-08 23:41:29,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:29,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:41:29,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 985496973, now seen corresponding path program 1 times [2025-01-08 23:41:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622251300] [2025-01-08 23:41:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-08 23:41:29,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-08 23:41:29,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622251300] [2025-01-08 23:41:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622251300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092831035] [2025-01-08 23:41:29,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:29,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:29,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:29,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:29,468 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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:41:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:30,027 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-01-08 23:41:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:30,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2025-01-08 23:41:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:30,032 INFO L225 Difference]: With dead ends: 2314 [2025-01-08 23:41:30,032 INFO L226 Difference]: Without dead ends: 1527 [2025-01-08 23:41:30,033 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:41:30,034 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:30,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-01-08 23:41:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-01-08 23:41:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 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:41:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-01-08 23:41:30,062 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 104 [2025-01-08 23:41:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-01-08 23:41:30,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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:41:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-01-08 23:41:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 23:41:30,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:30,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:41:30,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1488584310, now seen corresponding path program 1 times [2025-01-08 23:41:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020316306] [2025-01-08 23:41:30,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:30,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 23:41:30,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 23:41:30,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:30,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:30,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020316306] [2025-01-08 23:41:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020316306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092566199] [2025-01-08 23:41:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:30,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:30,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:30,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:30,281 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:41:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:30,878 INFO L93 Difference]: Finished difference Result 3257 states and 4123 transitions. [2025-01-08 23:41:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 161 [2025-01-08 23:41:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:30,886 INFO L225 Difference]: With dead ends: 3257 [2025-01-08 23:41:30,886 INFO L226 Difference]: Without dead ends: 1917 [2025-01-08 23:41:30,888 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:41:30,890 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 201 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:30,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-08 23:41:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-01-08 23:41:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.2462101411395714) internal successors, (2384), 1913 states have internal predecessors, (2384), 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:41:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2384 transitions. [2025-01-08 23:41:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2384 transitions. Word has length 161 [2025-01-08 23:41:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:30,919 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2384 transitions. [2025-01-08 23:41:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:41:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2384 transitions. [2025-01-08 23:41:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-08 23:41:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:30,923 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:41:30,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1041527191, now seen corresponding path program 1 times [2025-01-08 23:41:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770237938] [2025-01-08 23:41:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:30,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 23:41:30,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 23:41:30,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:30,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:41:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770237938] [2025-01-08 23:41:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770237938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863582802] [2025-01-08 23:41:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:31,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:31,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:31,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:31,135 INFO L87 Difference]: Start difference. First operand 1914 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:41:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:31,757 INFO L93 Difference]: Finished difference Result 4389 states and 5590 transitions. [2025-01-08 23:41:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 216 [2025-01-08 23:41:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:31,765 INFO L225 Difference]: With dead ends: 4389 [2025-01-08 23:41:31,765 INFO L226 Difference]: Without dead ends: 2661 [2025-01-08 23:41:31,768 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:41:31,768 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 163 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:31,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 391 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-01-08 23:41:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-01-08 23:41:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.2347931873479319) internal successors, (3045), 2466 states have internal predecessors, (3045), 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:41:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3045 transitions. [2025-01-08 23:41:31,813 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3045 transitions. Word has length 216 [2025-01-08 23:41:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3045 transitions. [2025-01-08 23:41:31,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:41:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3045 transitions. [2025-01-08 23:41:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-08 23:41:31,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:31,816 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:31,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:41:31,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:31,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1661261338, now seen corresponding path program 1 times [2025-01-08 23:41:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:31,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646587829] [2025-01-08 23:41:31,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-08 23:41:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-08 23:41:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:41:32,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646587829] [2025-01-08 23:41:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646587829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884579248] [2025-01-08 23:41:32,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:32,192 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:41:32,195 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:41:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-08 23:41:32,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-08 23:41:32,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:32,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:32,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:41:32,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:41:32,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884579248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:32,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:41:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296081357] [2025-01-08 23:41:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:32,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:32,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:32,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:41:32,353 INFO L87 Difference]: Start difference. First operand 2467 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:41:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:32,993 INFO L93 Difference]: Finished difference Result 6589 states and 8262 transitions. [2025-01-08 23:41:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 222 [2025-01-08 23:41:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:33,003 INFO L225 Difference]: With dead ends: 6589 [2025-01-08 23:41:33,003 INFO L226 Difference]: Without dead ends: 4124 [2025-01-08 23:41:33,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 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:41:33,006 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 177 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:33,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 147 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2025-01-08 23:41:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4124. [2025-01-08 23:41:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 4123 states have (on average 1.2277467863206404) internal successors, (5062), 4123 states have internal predecessors, (5062), 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:41:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 5062 transitions. [2025-01-08 23:41:33,056 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 5062 transitions. Word has length 222 [2025-01-08 23:41:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:33,056 INFO L471 AbstractCegarLoop]: Abstraction has 4124 states and 5062 transitions. [2025-01-08 23:41:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:41:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 5062 transitions. [2025-01-08 23:41:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-08 23:41:33,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:33,059 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, 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] [2025-01-08 23:41:33,066 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:41:33,260 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:41:33,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:33,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1919712134, now seen corresponding path program 1 times [2025-01-08 23:41:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:33,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649285312] [2025-01-08 23:41:33,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-08 23:41:33,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-08 23:41:33,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:41:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649285312] [2025-01-08 23:41:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649285312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:33,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537312039] [2025-01-08 23:41:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:33,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:33,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:33,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:33,482 INFO L87 Difference]: Start difference. First operand 4124 states and 5062 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:41:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:34,113 INFO L93 Difference]: Finished difference Result 9544 states and 11864 transitions. [2025-01-08 23:41:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:34,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 253 [2025-01-08 23:41:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:34,125 INFO L225 Difference]: With dead ends: 9544 [2025-01-08 23:41:34,125 INFO L226 Difference]: Without dead ends: 5422 [2025-01-08 23:41:34,128 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:41:34,128 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 208 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:34,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 158 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2025-01-08 23:41:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5237. [2025-01-08 23:41:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5237 states, 5236 states have (on average 1.2293735676088617) internal successors, (6437), 5236 states have internal predecessors, (6437), 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:41:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5237 states to 5237 states and 6437 transitions. [2025-01-08 23:41:34,207 INFO L78 Accepts]: Start accepts. Automaton has 5237 states and 6437 transitions. Word has length 253 [2025-01-08 23:41:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:34,207 INFO L471 AbstractCegarLoop]: Abstraction has 5237 states and 6437 transitions. [2025-01-08 23:41:34,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:41:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5237 states and 6437 transitions. [2025-01-08 23:41:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-08 23:41:34,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:34,215 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, 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, 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] [2025-01-08 23:41:34,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:41:34,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:34,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash 140798852, now seen corresponding path program 1 times [2025-01-08 23:41:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:34,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447541104] [2025-01-08 23:41:34,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:34,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-08 23:41:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-08 23:41:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447541104] [2025-01-08 23:41:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447541104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:34,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:34,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000146944] [2025-01-08 23:41:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:34,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:34,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:34,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:34,443 INFO L87 Difference]: Start difference. First operand 5237 states and 6437 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:41:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:35,018 INFO L93 Difference]: Finished difference Result 12144 states and 15067 transitions. [2025-01-08 23:41:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 304 [2025-01-08 23:41:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:35,033 INFO L225 Difference]: With dead ends: 12144 [2025-01-08 23:41:35,033 INFO L226 Difference]: Without dead ends: 6909 [2025-01-08 23:41:35,039 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:41:35,040 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 62 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:35,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2025-01-08 23:41:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6526. [2025-01-08 23:41:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6526 states, 6525 states have (on average 1.2134865900383143) internal successors, (7918), 6525 states have internal predecessors, (7918), 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:41:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 7918 transitions. [2025-01-08 23:41:35,114 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 7918 transitions. Word has length 304 [2025-01-08 23:41:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:35,115 INFO L471 AbstractCegarLoop]: Abstraction has 6526 states and 7918 transitions. [2025-01-08 23:41:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:41:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 7918 transitions. [2025-01-08 23:41:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-08 23:41:35,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:35,120 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, 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, 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] [2025-01-08 23:41:35,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:41:35,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1963790271, now seen corresponding path program 1 times [2025-01-08 23:41:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734103721] [2025-01-08 23:41:35,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:35,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:35,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-08 23:41:35,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-08 23:41:35,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:35,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:41:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734103721] [2025-01-08 23:41:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734103721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:35,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700647888] [2025-01-08 23:41:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:35,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:35,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:35,306 INFO L87 Difference]: Start difference. First operand 6526 states and 7918 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:41:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:35,845 INFO L93 Difference]: Finished difference Result 12465 states and 15061 transitions. [2025-01-08 23:41:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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 318 [2025-01-08 23:41:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:35,846 INFO L225 Difference]: With dead ends: 12465 [2025-01-08 23:41:35,846 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:41:35,855 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:41:35,858 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 135 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:35,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 151 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:41:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:41:35,859 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:41:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:41:35,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2025-01-08 23:41:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:35,860 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:41:35,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:41:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:41:35,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:41:35,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:41:35,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:41:35,865 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:35,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:41:35,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:41:35,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:41:35 BoogieIcfgContainer [2025-01-08 23:41:35,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:41:35,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:41:35,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:41:35,997 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:41:35,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:27" (3/4) ... [2025-01-08 23:41:35,998 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:41:36,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:41:36,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:41:36,017 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:41:36,017 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:41:36,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:41:36,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:41:36,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:41:36,131 INFO L158 Benchmark]: Toolchain (without parser) took 11103.41ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 127.4MB in the beginning and 216.0MB in the end (delta: -88.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,131 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:41:36,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.71ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 84.3MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.17ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 67.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,132 INFO L158 Benchmark]: Boogie Preprocessor took 132.88ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 42.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,132 INFO L158 Benchmark]: RCFGBuilder took 1308.10ms. Allocated memory is still 167.8MB. Free memory was 42.8MB in the beginning and 101.4MB in the end (delta: -58.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,133 INFO L158 Benchmark]: TraceAbstraction took 8935.25ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 101.4MB in the beginning and 232.7MB in the end (delta: -131.3MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,133 INFO L158 Benchmark]: Witness Printer took 134.03ms. Allocated memory is still 293.6MB. Free memory was 232.7MB in the beginning and 216.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:36,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.71ms. Allocated memory is still 167.8MB. Free memory was 127.1MB in the beginning and 84.3MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.17ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 67.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.88ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 42.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1308.10ms. Allocated memory is still 167.8MB. Free memory was 42.8MB in the beginning and 101.4MB in the end (delta: -58.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8935.25ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 101.4MB in the beginning and 232.7MB in the end (delta: -131.3MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. * Witness Printer took 134.03ms. Allocated memory is still 293.6MB. Free memory was 232.7MB in the beginning and 216.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. 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: 118]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1427 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1427 mSDsluCounter, 2039 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 1025 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4917 IncrementalHoareTripleChecker+Invalid, 5942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1025 mSolverCounterUnsat, 1823 mSDtfsCounter, 4917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6526occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 776 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1934 NumberOfCodeBlocks, 1934 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1924 ConstructedInterpolants, 0 QuantifiedInterpolants, 5290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1143/1181 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: 1044]: Loop Invariant Derived loop invariant: (((((((a29 <= 245) && (a4 == 1)) || ((a25 == 12) && (a4 == 1))) || ((a4 == 1) && (97 <= a23))) || (a4 == 0)) || ((a25 == 11) && (a4 == 1))) || ((a25 <= 10) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:41:36,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE