./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i -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 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:13:03,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:13:03,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:13:03,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:13:03,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:13:03,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:13:03,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:13:03,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:13:03,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:13:03,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:13:03,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:13:03,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:13:03,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:13:03,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:13:03,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:13:03,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:13:03,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:13:03,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:13:03,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:13:03,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:13:03,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:13:03,375 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 -> 18819524c4696c98829402bf6bc4e99abd24bef1d74fc8ec0e3ebc5e4b11aa39 [2025-02-05 21:13:03,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:13:03,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:13:03,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:13:03,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:13:03,648 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:13:03,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-02-05 21:13:04,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0b4447a/140e3b015aed495495c83efad32bc0e8/FLAGcd4764f72 [2025-02-05 21:13:05,195 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:13:05,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-02-05 21:13:05,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0b4447a/140e3b015aed495495c83efad32bc0e8/FLAGcd4764f72 [2025-02-05 21:13:05,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c0b4447a/140e3b015aed495495c83efad32bc0e8 [2025-02-05 21:13:05,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:13:05,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:13:05,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:13:05,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:13:05,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:13:05,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05, skipping insertion in model container [2025-02-05 21:13:05,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:13:05,657 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i[916,929] [2025-02-05 21:13:05,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:13:05,776 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:13:05,785 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-52.i[916,929] [2025-02-05 21:13:05,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:13:05,855 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:13:05,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05 WrapperNode [2025-02-05 21:13:05,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:13:05,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:13:05,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:13:05,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:13:05,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,922 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 311 [2025-02-05 21:13:05,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:13:05,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:13:05,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:13:05,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:13:05,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:13:05,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:05,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:13:05,994 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:13:05,994 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:13:05,994 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:13:05,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (1/1) ... [2025-02-05 21:13:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:13:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:13:06,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:13:06,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:13:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:13:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:13:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:13:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:13:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:13:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:13:06,153 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:13:06,155 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:13:06,643 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 21:13:06,643 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:13:06,661 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:13:06,661 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:13:06,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:13:06 BoogieIcfgContainer [2025-02-05 21:13:06,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:13:06,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:13:06,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:13:06,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:13:06,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:13:05" (1/3) ... [2025-02-05 21:13:06,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f356e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:13:06, skipping insertion in model container [2025-02-05 21:13:06,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:13:05" (2/3) ... [2025-02-05 21:13:06,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f356e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:13:06, skipping insertion in model container [2025-02-05 21:13:06,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:13:06" (3/3) ... [2025-02-05 21:13:06,672 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i [2025-02-05 21:13:06,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:13:06,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-52.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:13:06,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:13:06,769 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;@3f841412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:13:06,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:13:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:13:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-05 21:13:06,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:06,796 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:06,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1940074258, now seen corresponding path program 1 times [2025-02-05 21:13:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:06,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-02-05 21:13:06,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-05 21:13:06,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-05 21:13:06,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-02-05 21:13:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:07,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-02-05 21:13:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797250800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:13:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768666210] [2025-02-05 21:13:07,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:13:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:13:07,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:13:07,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:13:07,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-05 21:13:07,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-05 21:13:07,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:07,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:07,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:13:07,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:13:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-02-05 21:13:07,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:13:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768666210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:07,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:13:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:13:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595372449] [2025-02-05 21:13:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:07,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:13:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:07,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:13:07,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:13:07,612 INFO L87 Difference]: Start difference. First operand has 134 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-05 21:13:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:07,662 INFO L93 Difference]: Finished difference Result 258 states and 466 transitions. [2025-02-05 21:13:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:13:07,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 286 [2025-02-05 21:13:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:07,675 INFO L225 Difference]: With dead ends: 258 [2025-02-05 21:13:07,676 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 21:13:07,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:13:07,682 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:07,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:13:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 21:13:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-05 21:13:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 21:13:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 202 transitions. [2025-02-05 21:13:07,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 202 transitions. Word has length 286 [2025-02-05 21:13:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:07,742 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 202 transitions. [2025-02-05 21:13:07,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-05 21:13:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 202 transitions. [2025-02-05 21:13:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-05 21:13:07,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:07,749 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:07,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:13:07,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:13:07,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1197285140, now seen corresponding path program 1 times [2025-02-05 21:13:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-02-05 21:13:07,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:08,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-05 21:13:08,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-05 21:13:08,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:08,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-02-05 21:13:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801957202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:08,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:08,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:13:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010115276] [2025-02-05 21:13:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:13:08,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:08,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:13:08,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:13:08,469 INFO L87 Difference]: Start difference. First operand 127 states and 202 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:08,563 INFO L93 Difference]: Finished difference Result 326 states and 520 transitions. [2025-02-05 21:13:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:13:08,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 286 [2025-02-05 21:13:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:08,567 INFO L225 Difference]: With dead ends: 326 [2025-02-05 21:13:08,569 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 21:13:08,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:13:08,572 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 116 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:08,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:13:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 21:13:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-02-05 21:13:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 133 states have internal predecessors, (190), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-05 21:13:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2025-02-05 21:13:08,612 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 286 [2025-02-05 21:13:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:08,615 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2025-02-05 21:13:08,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2025-02-05 21:13:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 21:13:08,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:08,623 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:13:08,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1312302997, now seen corresponding path program 1 times [2025-02-05 21:13:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:08,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-02-05 21:13:08,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:08,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 21:13:08,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 21:13:08,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:08,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542475783] [2025-02-05 21:13:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542475783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:13:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776009858] [2025-02-05 21:13:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:20,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:13:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:20,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:13:20,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:13:20,992 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:24,423 INFO L93 Difference]: Finished difference Result 677 states and 1065 transitions. [2025-02-05 21:13:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:13:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 287 [2025-02-05 21:13:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:24,429 INFO L225 Difference]: With dead ends: 677 [2025-02-05 21:13:24,429 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 21:13:24,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:13:24,432 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 358 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:24,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1456 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:13:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 21:13:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 353. [2025-02-05 21:13:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 239 states have (on average 1.4435146443514644) internal successors, (345), 240 states have internal predecessors, (345), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 565 transitions. [2025-02-05 21:13:24,513 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 565 transitions. Word has length 287 [2025-02-05 21:13:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 565 transitions. [2025-02-05 21:13:24,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 565 transitions. [2025-02-05 21:13:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 21:13:24,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:24,520 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:24,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:13:24,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:24,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1441385716, now seen corresponding path program 1 times [2025-02-05 21:13:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227999390] [2025-02-05 21:13:24,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:24,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 21:13:24,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 21:13:24,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:24,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227999390] [2025-02-05 21:13:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227999390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:13:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479055988] [2025-02-05 21:13:24,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:24,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:13:24,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:24,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:13:24,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:13:24,785 INFO L87 Difference]: Start difference. First operand 353 states and 565 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:25,018 INFO L93 Difference]: Finished difference Result 767 states and 1229 transitions. [2025-02-05 21:13:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:13:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-02-05 21:13:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:25,026 INFO L225 Difference]: With dead ends: 767 [2025-02-05 21:13:25,026 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 21:13:25,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:25,030 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 218 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:25,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 822 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:13:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 21:13:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 359. [2025-02-05 21:13:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 245 states have (on average 1.4326530612244899) internal successors, (351), 246 states have internal predecessors, (351), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 571 transitions. [2025-02-05 21:13:25,098 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 571 transitions. Word has length 287 [2025-02-05 21:13:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 571 transitions. [2025-02-05 21:13:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 571 transitions. [2025-02-05 21:13:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 21:13:25,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:25,104 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:13:25,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1277065428, now seen corresponding path program 1 times [2025-02-05 21:13:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294526725] [2025-02-05 21:13:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 21:13:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 21:13:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294526725] [2025-02-05 21:13:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294526725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 21:13:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869623423] [2025-02-05 21:13:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:13:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:31,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:13:31,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:13:31,747 INFO L87 Difference]: Start difference. First operand 359 states and 571 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:33,089 INFO L93 Difference]: Finished difference Result 651 states and 1021 transitions. [2025-02-05 21:13:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:13:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 287 [2025-02-05 21:13:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:33,094 INFO L225 Difference]: With dead ends: 651 [2025-02-05 21:13:33,094 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 21:13:33,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:13:33,095 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 258 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:33,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1750 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:13:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 21:13:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 373. [2025-02-05 21:13:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 259 states have (on average 1.4247104247104247) internal successors, (369), 260 states have internal predecessors, (369), 110 states have call successors, (110), 3 states have call predecessors, (110), 3 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 589 transitions. [2025-02-05 21:13:33,133 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 589 transitions. Word has length 287 [2025-02-05 21:13:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:33,134 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 589 transitions. [2025-02-05 21:13:33,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 589 transitions. [2025-02-05 21:13:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 21:13:33,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:33,137 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:13:33,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1406148147, now seen corresponding path program 1 times [2025-02-05 21:13:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:33,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-02-05 21:13:33,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:33,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 21:13:33,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 21:13:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:33,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-02-05 21:13:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166870798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:33,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:13:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808137825] [2025-02-05 21:13:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:33,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:13:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:33,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:13:33,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:33,616 INFO L87 Difference]: Start difference. First operand 373 states and 589 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:33,746 INFO L93 Difference]: Finished difference Result 663 states and 1022 transitions. [2025-02-05 21:13:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:13:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-02-05 21:13:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:33,751 INFO L225 Difference]: With dead ends: 663 [2025-02-05 21:13:33,751 INFO L226 Difference]: Without dead ends: 453 [2025-02-05 21:13:33,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:33,752 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 90 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:33,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 557 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:13:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-05 21:13:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 393. [2025-02-05 21:13:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 276 states have (on average 1.3985507246376812) internal successors, (386), 277 states have internal predecessors, (386), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 606 transitions. [2025-02-05 21:13:33,793 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 606 transitions. Word has length 287 [2025-02-05 21:13:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 606 transitions. [2025-02-05 21:13:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 606 transitions. [2025-02-05 21:13:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 21:13:33,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:33,801 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:13:33,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:33,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1475112490, now seen corresponding path program 1 times [2025-02-05 21:13:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626005414] [2025-02-05 21:13:33,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:33,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 21:13:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 21:13:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:33,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626005414] [2025-02-05 21:13:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626005414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:13:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315914028] [2025-02-05 21:13:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:13:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:33,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:13:33,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:13:33,940 INFO L87 Difference]: Start difference. First operand 393 states and 606 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:34,163 INFO L93 Difference]: Finished difference Result 613 states and 945 transitions. [2025-02-05 21:13:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:13:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 287 [2025-02-05 21:13:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:34,167 INFO L225 Difference]: With dead ends: 613 [2025-02-05 21:13:34,167 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 21:13:34,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:13:34,170 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 173 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:34,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 285 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:13:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 21:13:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-02-05 21:13:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 270 states have (on average 1.3777777777777778) internal successors, (372), 271 states have internal predecessors, (372), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2025-02-05 21:13:34,210 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 287 [2025-02-05 21:13:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:34,211 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2025-02-05 21:13:34,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-02-05 21:13:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2025-02-05 21:13:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-02-05 21:13:34,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:34,216 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:34,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:13:34,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:34,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash 452474354, now seen corresponding path program 1 times [2025-02-05 21:13:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742742623] [2025-02-05 21:13:34,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:34,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 21:13:34,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 21:13:34,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:34,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742742623] [2025-02-05 21:13:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742742623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 21:13:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040708227] [2025-02-05 21:13:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 21:13:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 21:13:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:13:41,433 INFO L87 Difference]: Start difference. First operand 387 states and 592 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) [2025-02-05 21:13:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:44,568 INFO L93 Difference]: Finished difference Result 457 states and 676 transitions. [2025-02-05 21:13:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:13:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) Word has length 288 [2025-02-05 21:13:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:44,575 INFO L225 Difference]: With dead ends: 457 [2025-02-05 21:13:44,576 INFO L226 Difference]: Without dead ends: 455 [2025-02-05 21:13:44,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 21:13:44,577 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 511 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:44,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1392 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:13:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-05 21:13:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 393. [2025-02-05 21:13:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 276 states have (on average 1.3768115942028984) internal successors, (380), 277 states have internal predecessors, (380), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 600 transitions. [2025-02-05 21:13:44,619 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 600 transitions. Word has length 288 [2025-02-05 21:13:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 600 transitions. [2025-02-05 21:13:44,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 4 states have call predecessors, (46), 5 states have call successors, (46) [2025-02-05 21:13:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 600 transitions. [2025-02-05 21:13:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-02-05 21:13:44,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:44,624 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:13:44,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:13:44,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash -933293292, now seen corresponding path program 1 times [2025-02-05 21:13:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559842282] [2025-02-05 21:13:44,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 21:13:44,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 21:13:44,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:44,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-05 21:13:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559842282] [2025-02-05 21:13:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559842282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:13:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:13:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:13:47,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447476297] [2025-02-05 21:13:47,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:13:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:13:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:13:47,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:13:47,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:13:47,527 INFO L87 Difference]: Start difference. First operand 393 states and 600 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:13:48,190 INFO L93 Difference]: Finished difference Result 635 states and 963 transitions. [2025-02-05 21:13:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:13:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 288 [2025-02-05 21:13:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:13:48,193 INFO L225 Difference]: With dead ends: 635 [2025-02-05 21:13:48,193 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 21:13:48,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:13:48,195 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 285 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:13:48,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1179 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:13:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 21:13:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 391. [2025-02-05 21:13:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 275 states have internal predecessors, (376), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:13:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 596 transitions. [2025-02-05 21:13:48,229 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 596 transitions. Word has length 288 [2025-02-05 21:13:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:13:48,229 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 596 transitions. [2025-02-05 21:13:48,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 21:13:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 596 transitions. [2025-02-05 21:13:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 21:13:48,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:13:48,240 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 21:13:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:13:48,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:13:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:13:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -166594627, now seen corresponding path program 1 times [2025-02-05 21:13:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:13:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462653404] [2025-02-05 21:13:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:13:48,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 21:13:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 21:13:48,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16843 backedges. 1 proven. 98 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:13:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:13:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462653404] [2025-02-05 21:13:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462653404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:13:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236480345] [2025-02-05 21:13:55,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:13:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:13:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:13:55,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:13:55,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:13:55,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 21:13:55,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 21:13:55,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:13:55,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:13:55,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 21:13:55,834 INFO L279 TraceCheckSpWp]: Computing forward predicates...