./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_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/Problem01_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 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:52:33,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:52:33,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:52:33,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:52:33,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:52:33,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:52:33,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:52:33,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:52:33,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:52:33,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:52:33,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:52:33,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:52:33,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:52:33,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:52:33,977 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:52:33,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:52:33,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:52:33,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:52:33,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:52:33,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:52:33,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:52:33,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:33,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:33,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:33,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:33,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:52:33,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:33,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:52:33,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:52:33,981 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 -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2025-01-08 22:52:34,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:52:34,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:52:34,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:52:34,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:52:34,198 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:52:34,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2025-01-08 22:52:35,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae62efcfc/32c0e796bfa546748fe2f397f4dd130c/FLAGb239d264c [2025-01-08 22:52:35,614 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:52:35,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2025-01-08 22:52:35,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae62efcfc/32c0e796bfa546748fe2f397f4dd130c/FLAGb239d264c [2025-01-08 22:52:35,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae62efcfc/32c0e796bfa546748fe2f397f4dd130c [2025-01-08 22:52:35,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:52:35,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:52:35,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:35,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:52:35,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:52:35,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:35" (1/1) ... [2025-01-08 22:52:35,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca826b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:35, skipping insertion in model container [2025-01-08 22:52:35,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:35" (1/1) ... [2025-01-08 22:52:35,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:52:36,120 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/Problem01_label18.c[17985,17998] [2025-01-08 22:52:36,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:36,155 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:52:36,200 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/Problem01_label18.c[17985,17998] [2025-01-08 22:52:36,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:36,218 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:52:36,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36 WrapperNode [2025-01-08 22:52:36,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:36,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:36,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:52:36,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:52:36,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,272 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:52:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:36,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:52:36,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:52:36,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:52:36,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,307 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 22:52:36,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:52:36,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:52:36,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:52:36,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:52:36,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (1/1) ... [2025-01-08 22:52:36,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:36,391 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 22:52:36,394 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 22:52:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:52:36,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:52:36,468 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:52:36,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:52:37,316 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:52:37,318 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:52:37,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:52:37,329 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:52:37,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:37 BoogieIcfgContainer [2025-01-08 22:52:37,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:52:37,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:52:37,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:52:37,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:52:37,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:35" (1/3) ... [2025-01-08 22:52:37,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3176eee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:37, skipping insertion in model container [2025-01-08 22:52:37,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:36" (2/3) ... [2025-01-08 22:52:37,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3176eee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:37, skipping insertion in model container [2025-01-08 22:52:37,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:37" (3/3) ... [2025-01-08 22:52:37,339 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2025-01-08 22:52:37,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:52:37,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label18.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:52:37,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:52:37,435 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;@653e5e63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:52:37,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:52:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 22:52:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 22:52:37,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:37,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:37,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1758306335, now seen corresponding path program 1 times [2025-01-08 22:52:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115886067] [2025-01-08 22:52:37,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 22:52:37,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 22:52:37,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:37,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:37,833 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 22:52:37,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115886067] [2025-01-08 22:52:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115886067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564539258] [2025-01-08 22:52:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:37,860 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 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 22:52:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:38,417 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-01-08 22:52:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:38,419 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 22:52:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:38,426 INFO L225 Difference]: With dead ends: 528 [2025-01-08 22:52:38,426 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:52:38,431 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 22:52:38,433 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 82 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:38,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:52:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:52:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:52:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 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 22:52:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2025-01-08 22:52:38,463 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 100 [2025-01-08 22:52:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:38,463 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2025-01-08 22:52:38,464 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 22:52:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2025-01-08 22:52:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-08 22:52:38,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:38,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:38,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:52:38,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -168464105, now seen corresponding path program 1 times [2025-01-08 22:52:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523490546] [2025-01-08 22:52:38,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:38,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-08 22:52:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-08 22:52:38,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:38,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:52:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523490546] [2025-01-08 22:52:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523490546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816738910] [2025-01-08 22:52:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:38,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:38,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:38,697 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 22:52:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:39,025 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2025-01-08 22:52:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 22:52:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:39,027 INFO L225 Difference]: With dead ends: 792 [2025-01-08 22:52:39,027 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:52:39,028 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 22:52:39,028 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:39,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:52:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-01-08 22:52:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 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 22:52:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2025-01-08 22:52:39,053 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 104 [2025-01-08 22:52:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:39,053 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2025-01-08 22:52:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 22:52:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2025-01-08 22:52:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-08 22:52:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:39,057 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:52:39,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -962932243, now seen corresponding path program 1 times [2025-01-08 22:52:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755369275] [2025-01-08 22:52:39,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-08 22:52:39,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-08 22:52:39,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:39,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755369275] [2025-01-08 22:52:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755369275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49191478] [2025-01-08 22:52:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:39,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:39,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:39,264 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:39,603 INFO L93 Difference]: Finished difference Result 1316 states and 1742 transitions. [2025-01-08 22:52:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-08 22:52:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:39,606 INFO L225 Difference]: With dead ends: 1316 [2025-01-08 22:52:39,606 INFO L226 Difference]: Without dead ends: 790 [2025-01-08 22:52:39,607 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 22:52:39,607 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:39,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 56 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-01-08 22:52:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-01-08 22:52:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.2750316856780735) internal successors, (1006), 789 states have internal predecessors, (1006), 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 22:52:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1006 transitions. [2025-01-08 22:52:39,625 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1006 transitions. Word has length 134 [2025-01-08 22:52:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:39,625 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1006 transitions. [2025-01-08 22:52:39,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1006 transitions. [2025-01-08 22:52:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-08 22:52:39,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:39,629 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:39,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:52:39,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -435757636, now seen corresponding path program 1 times [2025-01-08 22:52:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:39,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976017610] [2025-01-08 22:52:39,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:39,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-08 22:52:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-08 22:52:39,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:39,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:52:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976017610] [2025-01-08 22:52:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976017610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573726974] [2025-01-08 22:52:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:39,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:39,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:39,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:39,796 INFO L87 Difference]: Start difference. First operand 790 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 22:52:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:40,153 INFO L93 Difference]: Finished difference Result 1709 states and 2195 transitions. [2025-01-08 22:52:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 140 [2025-01-08 22:52:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:40,157 INFO L225 Difference]: With dead ends: 1709 [2025-01-08 22:52:40,157 INFO L226 Difference]: Without dead ends: 1052 [2025-01-08 22:52:40,158 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 22:52:40,158 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:40,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 74 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-08 22:52:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 790. [2025-01-08 22:52:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.2598225602027884) internal successors, (994), 789 states have internal predecessors, (994), 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 22:52:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2025-01-08 22:52:40,175 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 140 [2025-01-08 22:52:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2025-01-08 22:52:40,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 22:52:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2025-01-08 22:52:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-08 22:52:40,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:40,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:52:40,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392785, now seen corresponding path program 1 times [2025-01-08 22:52:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359054074] [2025-01-08 22:52:40,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:40,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-08 22:52:40,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-08 22:52:40,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:40,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:52:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359054074] [2025-01-08 22:52:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359054074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172769044] [2025-01-08 22:52:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:40,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:40,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:40,352 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 22:52:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:40,829 INFO L93 Difference]: Finished difference Result 1971 states and 2500 transitions. [2025-01-08 22:52:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 154 [2025-01-08 22:52:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:40,833 INFO L225 Difference]: With dead ends: 1971 [2025-01-08 22:52:40,833 INFO L226 Difference]: Without dead ends: 1183 [2025-01-08 22:52:40,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:40,835 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 394 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:40,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 47 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-08 22:52:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2025-01-08 22:52:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.2645099904852521) internal successors, (1329), 1051 states have internal predecessors, (1329), 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 22:52:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1329 transitions. [2025-01-08 22:52:40,850 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1329 transitions. Word has length 154 [2025-01-08 22:52:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1329 transitions. [2025-01-08 22:52:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 22:52:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1329 transitions. [2025-01-08 22:52:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-08 22:52:40,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:40,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:52:40,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:52:40,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash -373671574, now seen corresponding path program 1 times [2025-01-08 22:52:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677967347] [2025-01-08 22:52:40,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:40,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-08 22:52:40,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-08 22:52:40,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:40,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:52:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677967347] [2025-01-08 22:52:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677967347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835930424] [2025-01-08 22:52:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:40,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:40,936 INFO L87 Difference]: Start difference. First operand 1052 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:41,274 INFO L93 Difference]: Finished difference Result 2757 states and 3449 transitions. [2025-01-08 22:52:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-01-08 22:52:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:41,279 INFO L225 Difference]: With dead ends: 2757 [2025-01-08 22:52:41,280 INFO L226 Difference]: Without dead ends: 1707 [2025-01-08 22:52:41,281 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 22:52:41,281 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:41,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 23 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-01-08 22:52:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1314. [2025-01-08 22:52:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2482863670982483) internal successors, (1639), 1313 states have internal predecessors, (1639), 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 22:52:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1639 transitions. [2025-01-08 22:52:41,305 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1639 transitions. Word has length 163 [2025-01-08 22:52:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1639 transitions. [2025-01-08 22:52:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1639 transitions. [2025-01-08 22:52:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-08 22:52:41,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:41,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-08 22:52:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:52:41,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 329530488, now seen corresponding path program 1 times [2025-01-08 22:52:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004192861] [2025-01-08 22:52:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:41,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-08 22:52:41,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-08 22:52:41,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:52:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004192861] [2025-01-08 22:52:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004192861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:52:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081732010] [2025-01-08 22:52:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:41,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:41,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:41,484 INFO L87 Difference]: Start difference. First operand 1314 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 22:52:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:42,035 INFO L93 Difference]: Finished difference Result 3805 states and 4727 transitions. [2025-01-08 22:52:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 183 [2025-01-08 22:52:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:42,043 INFO L225 Difference]: With dead ends: 3805 [2025-01-08 22:52:42,043 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:52:42,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:42,046 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 245 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:42,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 41 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:52:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:52:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2025-01-08 22:52:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2063305978898007) internal successors, (2058), 1706 states have internal predecessors, (2058), 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 22:52:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2058 transitions. [2025-01-08 22:52:42,077 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2058 transitions. Word has length 183 [2025-01-08 22:52:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:42,077 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2058 transitions. [2025-01-08 22:52:42,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 22:52:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2058 transitions. [2025-01-08 22:52:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:52:42,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:42,081 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-08 22:52:42,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:52:42,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 26210033, now seen corresponding path program 1 times [2025-01-08 22:52:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545111408] [2025-01-08 22:52:42,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:42,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:52:42,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:52:42,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:42,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 125 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-08 22:52:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545111408] [2025-01-08 22:52:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545111408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639840103] [2025-01-08 22:52:42,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:42,327 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 22:52:42,329 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 22:52:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:52:42,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:52:42,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:42,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:42,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:42,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-08 22:52:42,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:42,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639840103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857509814] [2025-01-08 22:52:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:42,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:42,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:42,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:42,615 INFO L87 Difference]: Start difference. First operand 1707 states and 2058 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 22:52:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:42,944 INFO L93 Difference]: Finished difference Result 3805 states and 4543 transitions. [2025-01-08 22:52:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:42,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 206 [2025-01-08 22:52:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:42,950 INFO L225 Difference]: With dead ends: 3805 [2025-01-08 22:52:42,950 INFO L226 Difference]: Without dead ends: 1707 [2025-01-08 22:52:42,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:42,953 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 40 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:42,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 192 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-01-08 22:52:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2025-01-08 22:52:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1117460317460317) internal successors, (1751), 1575 states have internal predecessors, (1751), 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 22:52:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1751 transitions. [2025-01-08 22:52:42,978 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1751 transitions. Word has length 206 [2025-01-08 22:52:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:42,978 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1751 transitions. [2025-01-08 22:52:42,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 22:52:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1751 transitions. [2025-01-08 22:52:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-08 22:52:42,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:42,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:52:42,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:52:43,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:43,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -83585429, now seen corresponding path program 1 times [2025-01-08 22:52:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407939537] [2025-01-08 22:52:43,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:43,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-08 22:52:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-08 22:52:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407939537] [2025-01-08 22:52:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407939537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476240118] [2025-01-08 22:52:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:43,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:43,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:52:43,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-08 22:52:43,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-08 22:52:43,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:43,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:43,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:43,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-08 22:52:43,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476240118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 22:52:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455077383] [2025-01-08 22:52:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:52:43,790 INFO L87 Difference]: Start difference. First operand 1576 states and 1751 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 22:52:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:44,071 INFO L93 Difference]: Finished difference Result 3148 states and 3516 transitions. [2025-01-08 22:52:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 219 [2025-01-08 22:52:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:44,072 INFO L225 Difference]: With dead ends: 3148 [2025-01-08 22:52:44,072 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:52:44,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:52:44,075 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:44,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:52:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:52:44,076 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 22:52:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:52:44,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2025-01-08 22:52:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:44,077 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:52:44,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 22:52:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:52:44,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:52:44,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:52:44,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:52:44,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:44,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:44,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:52:44,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:52:44,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:44 BoogieIcfgContainer [2025-01-08 22:52:44,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:52:44,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:52:44,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:52:44,462 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:52:44,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:37" (3/4) ... [2025-01-08 22:52:44,464 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:52:44,479 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:52:44,480 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:52:44,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:52:44,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:52:44,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:52:44,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:52:44,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:52:44,586 INFO L158 Benchmark]: Toolchain (without parser) took 8671.48ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 103.6MB in the beginning and 258.3MB in the end (delta: -154.7MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,587 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:44,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.08ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 74.6MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 69.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:44,587 INFO L158 Benchmark]: Boogie Preprocessor took 87.52ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 65.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,588 INFO L158 Benchmark]: RCFGBuilder took 968.66ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 49.2MB in the end (delta: 15.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,588 INFO L158 Benchmark]: TraceAbstraction took 7129.14ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.5MB in the beginning and 270.6MB in the end (delta: -222.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,588 INFO L158 Benchmark]: Witness Printer took 123.61ms. Allocated memory is still 402.7MB. Free memory was 270.6MB in the beginning and 258.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:44,590 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.08ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 74.6MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 69.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.52ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 65.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 968.66ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 49.2MB in the end (delta: 15.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7129.14ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.5MB in the beginning and 270.6MB in the end (delta: -222.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 123.61ms. Allocated memory is still 402.7MB. Free memory was 270.6MB in the beginning and 258.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 486]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1222 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1222 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 674 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3475 IncrementalHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 674 mSolverCounterUnsat, 643 mSDtfsCounter, 3475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1828 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1817 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1050/1107 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: 593]: Loop Invariant Derived loop invariant: ((((((((((a21 == 1) && (a17 == 1)) && (a20 == 1)) || (((a7 != 1) && (a17 <= 0)) && (15 <= a8))) || ((a8 <= 13) && (a20 == 1))) || ((a17 <= 0) && (a16 <= 5))) || (((a7 != 1) && (a17 == 1)) && (15 <= a8))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 5))) || (((a8 <= 13) && (a7 != 1)) && (a16 <= 4))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:52:44,607 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