./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label14.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_label14.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 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:52:30,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:52:30,949 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:30,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:52:30,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:52:30,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:52:30,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:52:30,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:52:30,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:52:30,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:52:30,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:52:30,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:52:30,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:52:30,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:52:30,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:52:30,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:30,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:30,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:30,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:52:30,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:52:30,972 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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2025-01-08 22:52:31,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:52:31,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:52:31,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:52:31,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:52:31,172 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:52:31,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-01-08 22:52:32,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1c34a16/5d76e28befc346478574184cad2868be/FLAG2e0ed4f94 [2025-01-08 22:52:32,594 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:52:32,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-01-08 22:52:32,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1c34a16/5d76e28befc346478574184cad2868be/FLAG2e0ed4f94 [2025-01-08 22:52:32,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1c34a16/5d76e28befc346478574184cad2868be [2025-01-08 22:52:32,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:52:32,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:52:32,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:32,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:52:32,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:52:32,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:32" (1/1) ... [2025-01-08 22:52:32,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e2fe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:32, skipping insertion in model container [2025-01-08 22:52:32,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:32" (1/1) ... [2025-01-08 22:52:32,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:52:32,898 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_label14.c[21834,21847] [2025-01-08 22:52:32,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:32,917 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:52:32,970 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_label14.c[21834,21847] [2025-01-08 22:52:32,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:32,982 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:52:32,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:32 WrapperNode [2025-01-08 22:52:32,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:32,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:32,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:52:32,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:52:32,988 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:32" (1/1) ... [2025-01-08 22:52:32,996 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:32" (1/1) ... [2025-01-08 22:52:33,024 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:52:33,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:33,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:52:33,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:52:33,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:52:33,035 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:32" (1/1) ... [2025-01-08 22:52:33,036 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:32" (1/1) ... [2025-01-08 22:52:33,043 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:32" (1/1) ... [2025-01-08 22:52:33,061 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:33,062 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:32" (1/1) ... [2025-01-08 22:52:33,062 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:32" (1/1) ... [2025-01-08 22:52:33,076 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:32" (1/1) ... [2025-01-08 22:52:33,080 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:32" (1/1) ... [2025-01-08 22:52:33,088 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:32" (1/1) ... [2025-01-08 22:52:33,090 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:32" (1/1) ... [2025-01-08 22:52:33,091 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:32" (1/1) ... [2025-01-08 22:52:33,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:52:33,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:52:33,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:52:33,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:52:33,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:32" (1/1) ... [2025-01-08 22:52:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:33,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:33,127 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:33,130 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:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:52:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:52:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:52:33,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:52:33,199 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:52:33,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:52:33,927 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:52:33,928 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:52:33,940 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:52:33,941 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:52:33,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:33 BoogieIcfgContainer [2025-01-08 22:52:33,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:52:33,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:52:33,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:52:33,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:52:33,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:32" (1/3) ... [2025-01-08 22:52:33,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4d4771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:33, skipping insertion in model container [2025-01-08 22:52:33,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:32" (2/3) ... [2025-01-08 22:52:33,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4d4771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:33, skipping insertion in model container [2025-01-08 22:52:33,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:33" (3/3) ... [2025-01-08 22:52:33,949 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2025-01-08 22:52:33,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:52:33,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label14.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:52:34,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:52:34,018 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;@186ad00e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:52:34,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:52:34,021 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:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-08 22:52:34,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:34,029 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, 1, 1, 1, 1, 1, 1, 1, 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:34,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:34,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -557097607, now seen corresponding path program 1 times [2025-01-08 22:52:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678573925] [2025-01-08 22:52:34,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:34,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-08 22:52:34,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-08 22:52:34,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:34,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:34,778 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:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678573925] [2025-01-08 22:52:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678573925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301326102] [2025-01-08 22:52:34,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:34,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:34,795 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 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:35,560 INFO L93 Difference]: Finished difference Result 662 states and 1174 transitions. [2025-01-08 22:52:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:52:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2025-01-08 22:52:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:35,568 INFO L225 Difference]: With dead ends: 662 [2025-01-08 22:52:35,568 INFO L226 Difference]: Without dead ends: 397 [2025-01-08 22:52:35,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:35,572 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 293 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:35,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:52:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-08 22:52:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-01-08 22:52:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 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:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2025-01-08 22:52:35,619 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 131 [2025-01-08 22:52:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:35,620 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2025-01-08 22:52:35,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2025-01-08 22:52:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-08 22:52:35,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:35,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:52:35,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -195883637, now seen corresponding path program 1 times [2025-01-08 22:52:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697343942] [2025-01-08 22:52:35,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-08 22:52:35,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-08 22:52:35,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:35,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697343942] [2025-01-08 22:52:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697343942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:35,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559496402] [2025-01-08 22:52:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:35,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:35,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:35,986 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:36,587 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2025-01-08 22:52:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2025-01-08 22:52:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:36,590 INFO L225 Difference]: With dead ends: 887 [2025-01-08 22:52:36,590 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:52:36,591 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:36,592 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:36,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:52:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:52:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2025-01-08 22:52:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 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:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2025-01-08 22:52:36,605 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 138 [2025-01-08 22:52:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:36,605 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2025-01-08 22:52:36,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2025-01-08 22:52:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-08 22:52:36,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:36,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:52:36,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -34246131, now seen corresponding path program 1 times [2025-01-08 22:52:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459788862] [2025-01-08 22:52:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:36,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-08 22:52:36,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-08 22:52:36,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:36,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459788862] [2025-01-08 22:52:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459788862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085734779] [2025-01-08 22:52:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:36,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:36,731 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:37,137 INFO L93 Difference]: Finished difference Result 1054 states and 1283 transitions. [2025-01-08 22:52:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2025-01-08 22:52:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:37,141 INFO L225 Difference]: With dead ends: 1054 [2025-01-08 22:52:37,141 INFO L226 Difference]: Without dead ends: 659 [2025-01-08 22:52:37,142 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:37,147 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:37,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 33 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-01-08 22:52:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-01-08 22:52:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.1914893617021276) internal successors, (784), 658 states have internal predecessors, (784), 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,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 784 transitions. [2025-01-08 22:52:37,175 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 784 transitions. Word has length 146 [2025-01-08 22:52:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 784 transitions. [2025-01-08 22:52:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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,176 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 784 transitions. [2025-01-08 22:52:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-08 22:52:37,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:37,181 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:52:37,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:37,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1738889804, now seen corresponding path program 1 times [2025-01-08 22:52:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556479039] [2025-01-08 22:52:37,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:37,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-08 22:52:37,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-08 22:52:37,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:37,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 22:52:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556479039] [2025-01-08 22:52:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556479039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:37,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:37,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020734044] [2025-01-08 22:52:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:37,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:37,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:37,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:37,325 INFO L87 Difference]: Start difference. First operand 659 states and 784 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:37,660 INFO L93 Difference]: Finished difference Result 1840 states and 2180 transitions. [2025-01-08 22:52:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:37,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 171 [2025-01-08 22:52:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:37,663 INFO L225 Difference]: With dead ends: 1840 [2025-01-08 22:52:37,664 INFO L226 Difference]: Without dead ends: 1183 [2025-01-08 22:52:37,665 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:37,667 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:37,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-08 22:52:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2025-01-08 22:52:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1988582302568982) internal successors, (1260), 1051 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:52:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1260 transitions. [2025-01-08 22:52:37,685 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1260 transitions. Word has length 171 [2025-01-08 22:52:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:37,685 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1260 transitions. [2025-01-08 22:52:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1260 transitions. [2025-01-08 22:52:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-08 22:52:37,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:37,690 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:52:37,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 458666653, now seen corresponding path program 1 times [2025-01-08 22:52:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551880882] [2025-01-08 22:52:37,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:37,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-08 22:52:37,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-08 22:52:37,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-08 22:52:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551880882] [2025-01-08 22:52:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551880882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904137724] [2025-01-08 22:52:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:37,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:37,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:37,849 INFO L87 Difference]: Start difference. First operand 1052 states and 1260 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:38,144 INFO L93 Difference]: Finished difference Result 2364 states and 2811 transitions. [2025-01-08 22:52:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:38,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 177 [2025-01-08 22:52:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:38,149 INFO L225 Difference]: With dead ends: 2364 [2025-01-08 22:52:38,149 INFO L226 Difference]: Without dead ends: 1314 [2025-01-08 22:52:38,150 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:38,150 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:38,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-08 22:52:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-01-08 22:52:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1590524534686972) internal successors, (1370), 1182 states have internal predecessors, (1370), 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,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1370 transitions. [2025-01-08 22:52:38,166 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1370 transitions. Word has length 177 [2025-01-08 22:52:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:38,166 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1370 transitions. [2025-01-08 22:52:38,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1370 transitions. [2025-01-08 22:52:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-08 22:52:38,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:38,169 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:52:38,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -258314406, now seen corresponding path program 1 times [2025-01-08 22:52:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:38,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16671774] [2025-01-08 22:52:38,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:38,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-08 22:52:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-08 22:52:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 22:52:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:38,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16671774] [2025-01-08 22:52:38,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16671774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:38,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:38,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736241917] [2025-01-08 22:52:38,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:38,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:38,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:38,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:38,337 INFO L87 Difference]: Start difference. First operand 1183 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:38,798 INFO L93 Difference]: Finished difference Result 2757 states and 3180 transitions. [2025-01-08 22:52:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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 191 [2025-01-08 22:52:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:38,807 INFO L225 Difference]: With dead ends: 2757 [2025-01-08 22:52:38,807 INFO L226 Difference]: Without dead ends: 1576 [2025-01-08 22:52:38,808 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:38,809 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 344 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:38,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 44 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:52:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-08 22:52:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2025-01-08 22:52:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1454293628808865) internal successors, (1654), 1444 states have internal predecessors, (1654), 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1654 transitions. [2025-01-08 22:52:38,828 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1654 transitions. Word has length 191 [2025-01-08 22:52:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:38,829 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1654 transitions. [2025-01-08 22:52:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1654 transitions. [2025-01-08 22:52:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-08 22:52:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:38,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:52:38,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2075147906, now seen corresponding path program 1 times [2025-01-08 22:52:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511934793] [2025-01-08 22:52:38,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:38,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-08 22:52:38,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-08 22:52:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:52:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511934793] [2025-01-08 22:52:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511934793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661764460] [2025-01-08 22:52:39,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:39,036 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:39,043 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:39,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-08 22:52:39,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-08 22:52:39,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:39,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:39,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:39,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-08 22:52:39,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661764460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:39,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495282456] [2025-01-08 22:52:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:39,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:39,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:39,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:39,311 INFO L87 Difference]: Start difference. First operand 1445 states and 1654 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:39,615 INFO L93 Difference]: Finished difference Result 3281 states and 3775 transitions. [2025-01-08 22:52:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 208 [2025-01-08 22:52:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:39,621 INFO L225 Difference]: With dead ends: 3281 [2025-01-08 22:52:39,621 INFO L226 Difference]: Without dead ends: 1838 [2025-01-08 22:52:39,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 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:39,623 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:39,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-01-08 22:52:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-01-08 22:52:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.156506447831184) internal successors, (1973), 1706 states have internal predecessors, (1973), 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,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1973 transitions. [2025-01-08 22:52:39,646 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1973 transitions. Word has length 208 [2025-01-08 22:52:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:39,646 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1973 transitions. [2025-01-08 22:52:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1973 transitions. [2025-01-08 22:52:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-08 22:52:39,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:39,649 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:39,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:52:39,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:39,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 188703275, now seen corresponding path program 1 times [2025-01-08 22:52:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:39,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524619841] [2025-01-08 22:52:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 22:52:39,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 22:52:39,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:39,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 101 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:52:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524619841] [2025-01-08 22:52:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524619841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202801936] [2025-01-08 22:52:40,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:40,055 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:40,057 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:40,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 22:52:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 22:52:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:40,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:40,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-08 22:52:40,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202801936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456739432] [2025-01-08 22:52:40,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:40,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:40,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:40,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:40,285 INFO L87 Difference]: Start difference. First operand 1707 states and 1973 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:40,593 INFO L93 Difference]: Finished difference Result 4329 states and 5049 transitions. [2025-01-08 22:52:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 213 [2025-01-08 22:52:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:40,599 INFO L225 Difference]: With dead ends: 4329 [2025-01-08 22:52:40,599 INFO L226 Difference]: Without dead ends: 2624 [2025-01-08 22:52:40,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:40,601 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:40,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 168 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-01-08 22:52:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2624. [2025-01-08 22:52:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.1483034693099505) internal successors, (3012), 2623 states have internal predecessors, (3012), 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,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3012 transitions. [2025-01-08 22:52:40,634 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3012 transitions. Word has length 213 [2025-01-08 22:52:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:40,634 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3012 transitions. [2025-01-08 22:52:40,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3012 transitions. [2025-01-08 22:52:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 22:52:40,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:40,638 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:40,644 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:40,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:40,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:40,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1418339019, now seen corresponding path program 1 times [2025-01-08 22:52:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96639060] [2025-01-08 22:52:40,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:40,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 22:52:40,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 22:52:40,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:52:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96639060] [2025-01-08 22:52:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96639060] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:52:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126234558] [2025-01-08 22:52:41,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:41,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:41,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:41,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:52:41,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:52:41,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 22:52:41,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 22:52:41,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:52:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:52:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 22:52:41,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:52:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126234558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:52:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:52:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381227054] [2025-01-08 22:52:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:41,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:41,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:41,250 INFO L87 Difference]: Start difference. First operand 2624 states and 3012 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:41,538 INFO L93 Difference]: Finished difference Result 5637 states and 6467 transitions. [2025-01-08 22:52:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 217 [2025-01-08 22:52:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:41,539 INFO L225 Difference]: With dead ends: 5637 [2025-01-08 22:52:41,539 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:52:41,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 217 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:41,542 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:41,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:52:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:52:41,543 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:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:52:41,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2025-01-08 22:52:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:41,543 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:52:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:52:41,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:52:41,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:52:41,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:52:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:52:41,748 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:41,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:52:41,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:52:41,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:41 BoogieIcfgContainer [2025-01-08 22:52:41,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:52:41,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:52:41,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:52:41,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:52:41,916 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:33" (3/4) ... [2025-01-08 22:52:41,917 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:52:41,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:52:41,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:52:41,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:52:41,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:52:42,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:52:42,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:52:42,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:52:42,007 INFO L158 Benchmark]: Toolchain (without parser) took 9382.88ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 127.9MB in the beginning and 154.1MB in the end (delta: -26.2MB). Peak memory consumption was 202.8MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,007 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:42,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.66ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 101.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 95.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,008 INFO L158 Benchmark]: Boogie Preprocessor took 74.41ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 90.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,008 INFO L158 Benchmark]: RCFGBuilder took 842.42ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 91.6MB in the end (delta: -723.2kB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,008 INFO L158 Benchmark]: TraceAbstraction took 7971.26ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 90.8MB in the beginning and 166.6MB in the end (delta: -75.8MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,008 INFO L158 Benchmark]: Witness Printer took 91.53ms. Allocated memory is still 394.3MB. Free memory was 166.6MB in the beginning and 154.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:42,009 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.18ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.66ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 101.3MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 95.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.41ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 90.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 842.42ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 91.6MB in the end (delta: -723.2kB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7971.26ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 90.8MB in the beginning and 166.6MB in the end (delta: -75.8MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. * Witness Printer took 91.53ms. Allocated memory is still 394.3MB. Free memory was 166.6MB in the beginning and 154.1MB in the end (delta: 12.5MB). 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: 579]: 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: 7.8s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1431 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1431 mSDsluCounter, 820 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 716 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3690 IncrementalHoareTripleChecker+Invalid, 4406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 716 mSolverCounterUnsat, 750 mSDtfsCounter, 3690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2624occurred in iteration=8, InterpolantAutomatonStates: 32, 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, 655 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2230 NumberOfCodeBlocks, 2230 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 8390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1191 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1058/1091 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: ((((((((a8 <= 13) && (a16 <= 5)) || ((a8 <= 13) && (a20 == 1))) || ((a20 <= 0) && (a16 <= 5))) || (5 == a16)) || ((a7 != 1) && (a16 <= 5))) || ((a7 != 1) && (a20 == 1))) || ((a20 <= 0) && (a7 != 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:52:42,020 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