./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label49.c --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/eca-rers2012/Problem13_label49.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:46:25,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:46:25,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:46:25,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:46:25,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:46:25,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:46:25,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:46:25,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:46:25,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:46:25,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:46:25,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:46:25,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:46:25,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:46:25,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:46:25,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:46:25,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:46:25,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:46:25,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:46:25,967 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 -> dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd [2025-02-05 11:46:26,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:46:26,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:46:26,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:46:26,369 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:46:26,370 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:46:26,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2025-02-05 11:46:27,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6cf5a962/a184516eb5db454796e339260920b9e9/FLAG2a0e9f814 [2025-02-05 11:46:28,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:46:28,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2025-02-05 11:46:28,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6cf5a962/a184516eb5db454796e339260920b9e9/FLAG2a0e9f814 [2025-02-05 11:46:28,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6cf5a962/a184516eb5db454796e339260920b9e9 [2025-02-05 11:46:28,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:46:28,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:46:28,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:46:28,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:46:28,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:46:28,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:46:28" (1/1) ... [2025-02-05 11:46:28,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b0be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:28, skipping insertion in model container [2025-02-05 11:46:28,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:46:28" (1/1) ... [2025-02-05 11:46:28,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:46:28,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c[8258,8271] [2025-02-05 11:46:29,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:46:29,243 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:46:29,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c[8258,8271] [2025-02-05 11:46:29,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:46:29,566 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:46:29,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29 WrapperNode [2025-02-05 11:46:29,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:46:29,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:46:29,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:46:29,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:46:29,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:29,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:29,943 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:46:29,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:46:29,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:46:29,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:46:29,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:46:29,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:29,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,329 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 11:46:30,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:46:30,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:46:30,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:46:30,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:46:30,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (1/1) ... [2025-02-05 11:46:30,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:46:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:46:30,646 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 11:46:30,649 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 11:46:30,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:46:30,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:46:30,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:46:30,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:46:30,720 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:46:30,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:46:35,211 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:46:35,212 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:46:35,212 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:46:35,338 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:46:35,339 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:46:35,362 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:46:35,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:46:35,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:46:35 BoogieIcfgContainer [2025-02-05 11:46:35,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:46:35,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:46:35,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:46:35,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:46:35,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:46:28" (1/3) ... [2025-02-05 11:46:35,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fad473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:46:35, skipping insertion in model container [2025-02-05 11:46:35,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:29" (2/3) ... [2025-02-05 11:46:35,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fad473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:46:35, skipping insertion in model container [2025-02-05 11:46:35,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:46:35" (3/3) ... [2025-02-05 11:46:35,375 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label49.c [2025-02-05 11:46:35,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:46:35,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label49.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:46:35,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:46:35,513 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;@378815f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:46:35,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:46:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 11:46:35,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:35,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:35,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -13401968, now seen corresponding path program 1 times [2025-02-05 11:46:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101117411] [2025-02-05 11:46:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:35,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 11:46:35,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 11:46:35,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:35,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101117411] [2025-02-05 11:46:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101117411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:36,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460806653] [2025-02-05 11:46:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:36,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:46:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:36,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:46:36,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:46:36,084 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:42,920 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-02-05 11:46:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:46:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 11:46:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:42,979 INFO L225 Difference]: With dead ends: 3829 [2025-02-05 11:46:42,979 INFO L226 Difference]: Without dead ends: 2664 [2025-02-05 11:46:42,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:46:42,993 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2677 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2677 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2677 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-02-05 11:46:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-02-05 11:46:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-02-05 11:46:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-02-05 11:46:43,177 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 58 [2025-02-05 11:46:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:43,177 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-02-05 11:46:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-02-05 11:46:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 11:46:43,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:43,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:43,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:46:43,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1566068508, now seen corresponding path program 1 times [2025-02-05 11:46:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044383180] [2025-02-05 11:46:43,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:43,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 11:46:43,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 11:46:43,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:43,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:43,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044383180] [2025-02-05 11:46:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044383180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:46:43,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935617368] [2025-02-05 11:46:43,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:43,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:46:43,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:46:43,935 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 11:46:43,936 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 11:46:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 11:46:44,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 11:46:44,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:44,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:44,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:46:44,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:46:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 11:46:44,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:46:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935617368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:44,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:46:44,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 11:46:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427076150] [2025-02-05 11:46:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:44,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:44,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:44,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:46:44,219 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:47,827 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-02-05 11:46:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:47,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2025-02-05 11:46:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:47,850 INFO L225 Difference]: With dead ends: 6142 [2025-02-05 11:46:47,850 INFO L226 Difference]: Without dead ends: 4268 [2025-02-05 11:46:47,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 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 11:46:47,855 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:47,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1187 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:46:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-02-05 11:46:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-02-05 11:46:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-02-05 11:46:48,063 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 183 [2025-02-05 11:46:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:48,063 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-02-05 11:46:48,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-02-05 11:46:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 11:46:48,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:48,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 11:46:48,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:46:48,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:46:48,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:48,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1034496699, now seen corresponding path program 1 times [2025-02-05 11:46:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335953739] [2025-02-05 11:46:48,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:48,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:48,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 11:46:48,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 11:46:48,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:48,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:46:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335953739] [2025-02-05 11:46:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335953739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:48,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:48,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087803055] [2025-02-05 11:46:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:48,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:48,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:48,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:48,483 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:52,874 INFO L93 Difference]: Finished difference Result 10899 states and 15275 transitions. [2025-02-05 11:46:52,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:52,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-02-05 11:46:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:52,915 INFO L225 Difference]: With dead ends: 10899 [2025-02-05 11:46:52,915 INFO L226 Difference]: Without dead ends: 7434 [2025-02-05 11:46:52,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:52,928 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:52,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 957 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 11:46:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2025-02-05 11:46:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7426. [2025-02-05 11:46:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-02-05 11:46:53,071 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 225 [2025-02-05 11:46:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-02-05 11:46:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-02-05 11:46:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 11:46:53,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:53,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:46:53,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1986873790, now seen corresponding path program 1 times [2025-02-05 11:46:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513023051] [2025-02-05 11:46:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:53,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 11:46:53,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 11:46:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:46:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513023051] [2025-02-05 11:46:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513023051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:53,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330914360] [2025-02-05 11:46:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:53,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:53,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:53,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:53,362 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:56,918 INFO L93 Difference]: Finished difference Result 19621 states and 25905 transitions. [2025-02-05 11:46:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:56,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2025-02-05 11:46:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:56,953 INFO L225 Difference]: With dead ends: 19621 [2025-02-05 11:46:56,953 INFO L226 Difference]: Without dead ends: 12984 [2025-02-05 11:46:56,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:56,963 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:56,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 640 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:46:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2025-02-05 11:46:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 12975. [2025-02-05 11:46:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2720826267920455) internal successors, (16504), 12974 states have internal predecessors, (16504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16504 transitions. [2025-02-05 11:46:57,210 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16504 transitions. Word has length 239 [2025-02-05 11:46:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:57,210 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16504 transitions. [2025-02-05 11:46:57,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16504 transitions. [2025-02-05 11:46:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 11:46:57,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:57,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:57,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:46:57,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:57,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1322592025, now seen corresponding path program 1 times [2025-02-05 11:46:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794302103] [2025-02-05 11:46:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:57,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 11:46:57,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 11:46:57,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:57,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-05 11:46:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:57,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794302103] [2025-02-05 11:46:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794302103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:57,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:57,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295268937] [2025-02-05 11:46:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:57,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:57,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:57,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:57,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:57,396 INFO L87 Difference]: Start difference. First operand 12975 states and 16504 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:00,835 INFO L93 Difference]: Finished difference Result 36180 states and 46598 transitions. [2025-02-05 11:47:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2025-02-05 11:47:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:00,918 INFO L225 Difference]: With dead ends: 36180 [2025-02-05 11:47:00,918 INFO L226 Difference]: Without dead ends: 23994 [2025-02-05 11:47:00,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:00,967 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:00,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:47:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2025-02-05 11:47:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 23203. [2025-02-05 11:47:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23203 states, 23202 states have (on average 1.2067494181536074) internal successors, (27999), 23202 states have internal predecessors, (27999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 27999 transitions. [2025-02-05 11:47:01,415 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 27999 transitions. Word has length 255 [2025-02-05 11:47:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 23203 states and 27999 transitions. [2025-02-05 11:47:01,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 27999 transitions. [2025-02-05 11:47:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:47:01,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:01,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:47:01,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -418450255, now seen corresponding path program 1 times [2025-02-05 11:47:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138957918] [2025-02-05 11:47:01,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:01,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:47:01,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:47:01,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:01,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:47:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138957918] [2025-02-05 11:47:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138957918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835969691] [2025-02-05 11:47:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:01,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:01,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:01,541 INFO L87 Difference]: Start difference. First operand 23203 states and 27999 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:04,632 INFO L93 Difference]: Finished difference Result 57432 states and 70773 transitions. [2025-02-05 11:47:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-02-05 11:47:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:04,677 INFO L225 Difference]: With dead ends: 57432 [2025-02-05 11:47:04,677 INFO L226 Difference]: Without dead ends: 35018 [2025-02-05 11:47:04,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:04,696 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:04,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 923 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:47:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2025-02-05 11:47:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 33434. [2025-02-05 11:47:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33434 states, 33433 states have (on average 1.1907097777644842) internal successors, (39809), 33433 states have internal predecessors, (39809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33434 states to 33434 states and 39809 transitions. [2025-02-05 11:47:05,287 INFO L78 Accepts]: Start accepts. Automaton has 33434 states and 39809 transitions. Word has length 257 [2025-02-05 11:47:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 33434 states and 39809 transitions. [2025-02-05 11:47:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 33434 states and 39809 transitions. [2025-02-05 11:47:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-05 11:47:05,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:05,293 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:47:05,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash -634799652, now seen corresponding path program 1 times [2025-02-05 11:47:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:05,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943502925] [2025-02-05 11:47:05,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:05,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 11:47:05,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 11:47:05,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:05,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 11:47:05,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943502925] [2025-02-05 11:47:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943502925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:05,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:05,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190489644] [2025-02-05 11:47:05,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:05,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:47:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:05,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:47:05,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:05,802 INFO L87 Difference]: Start difference. First operand 33434 states and 39809 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:12,236 INFO L93 Difference]: Finished difference Result 117460 states and 141050 transitions. [2025-02-05 11:47:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:47:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-02-05 11:47:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:12,400 INFO L225 Difference]: With dead ends: 117460 [2025-02-05 11:47:12,400 INFO L226 Difference]: Without dead ends: 84815 [2025-02-05 11:47:12,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:12,439 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 1737 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 1188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1188 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:12,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 698 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1188 Valid, 6065 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 11:47:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84815 states. [2025-02-05 11:47:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84815 to 83900. [2025-02-05 11:47:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83900 states, 83899 states have (on average 1.1736254305772418) internal successors, (98466), 83899 states have internal predecessors, (98466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83900 states to 83900 states and 98466 transitions. [2025-02-05 11:47:13,516 INFO L78 Accepts]: Start accepts. Automaton has 83900 states and 98466 transitions. Word has length 346 [2025-02-05 11:47:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 83900 states and 98466 transitions. [2025-02-05 11:47:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 83900 states and 98466 transitions. [2025-02-05 11:47:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-05 11:47:13,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:13,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:47:13,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:13,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1148307152, now seen corresponding path program 1 times [2025-02-05 11:47:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173968985] [2025-02-05 11:47:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:13,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 11:47:13,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 11:47:13,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:13,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 11:47:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173968985] [2025-02-05 11:47:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173968985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966772882] [2025-02-05 11:47:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:14,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:14,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:14,059 INFO L87 Difference]: Start difference. First operand 83900 states and 98466 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:17,046 INFO L93 Difference]: Finished difference Result 167046 states and 196195 transitions. [2025-02-05 11:47:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2025-02-05 11:47:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:17,129 INFO L225 Difference]: With dead ends: 167046 [2025-02-05 11:47:17,130 INFO L226 Difference]: Without dead ends: 83935 [2025-02-05 11:47:17,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:17,152 INFO L435 NwaCegarLoop]: 1851 mSDtfsCounter, 753 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:17,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1993 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:47:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83935 states. [2025-02-05 11:47:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83935 to 83901. [2025-02-05 11:47:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83901 states, 83900 states have (on average 1.1574731823599522) internal successors, (97112), 83900 states have internal predecessors, (97112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83901 states to 83901 states and 97112 transitions. [2025-02-05 11:47:17,859 INFO L78 Accepts]: Start accepts. Automaton has 83901 states and 97112 transitions. Word has length 355 [2025-02-05 11:47:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:17,859 INFO L471 AbstractCegarLoop]: Abstraction has 83901 states and 97112 transitions. [2025-02-05 11:47:17,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 83901 states and 97112 transitions. [2025-02-05 11:47:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 11:47:17,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:17,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:47:17,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:17,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -208650623, now seen corresponding path program 1 times [2025-02-05 11:47:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948460682] [2025-02-05 11:47:17,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:47:17,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:47:17,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:17,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 11:47:18,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948460682] [2025-02-05 11:47:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948460682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137029007] [2025-02-05 11:47:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:18,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:18,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:18,138 INFO L87 Difference]: Start difference. First operand 83901 states and 97112 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:20,815 INFO L93 Difference]: Finished difference Result 171710 states and 198022 transitions. [2025-02-05 11:47:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 375 [2025-02-05 11:47:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:20,918 INFO L225 Difference]: With dead ends: 171710 [2025-02-05 11:47:20,918 INFO L226 Difference]: Without dead ends: 85445 [2025-02-05 11:47:20,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:20,967 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1037 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:20,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1648 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:47:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85445 states. [2025-02-05 11:47:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85445 to 80709. [2025-02-05 11:47:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80709 states, 80708 states have (on average 1.1047727610645786) internal successors, (89164), 80708 states have internal predecessors, (89164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80709 states to 80709 states and 89164 transitions. [2025-02-05 11:47:21,954 INFO L78 Accepts]: Start accepts. Automaton has 80709 states and 89164 transitions. Word has length 375 [2025-02-05 11:47:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:21,954 INFO L471 AbstractCegarLoop]: Abstraction has 80709 states and 89164 transitions. [2025-02-05 11:47:21,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 80709 states and 89164 transitions. [2025-02-05 11:47:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 11:47:21,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:21,958 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:47:21,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:21,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1831667535, now seen corresponding path program 1 times [2025-02-05 11:47:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:21,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82199935] [2025-02-05 11:47:21,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 11:47:21,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 11:47:21,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 11:47:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82199935] [2025-02-05 11:47:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82199935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:47:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448256806] [2025-02-05 11:47:22,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:22,940 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 11:47:22,941 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 11:47:22,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 11:47:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 11:47:23,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:23,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:23,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:47:23,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:47:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 11:47:23,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:47:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448256806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:47:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:47:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650377299] [2025-02-05 11:47:23,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:23,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:23,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:47:23,191 INFO L87 Difference]: Start difference. First operand 80709 states and 89164 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:25,621 INFO L93 Difference]: Finished difference Result 160627 states and 177533 transitions. [2025-02-05 11:47:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2025-02-05 11:47:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:25,710 INFO L225 Difference]: With dead ends: 160627 [2025-02-05 11:47:25,710 INFO L226 Difference]: Without dead ends: 80707 [2025-02-05 11:47:25,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:47:25,750 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:25,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1423 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:47:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80707 states. [2025-02-05 11:47:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80707 to 80706. [2025-02-05 11:47:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80706 states, 80705 states have (on average 1.0796109286909112) internal successors, (87130), 80705 states have internal predecessors, (87130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80706 states to 80706 states and 87130 transitions. [2025-02-05 11:47:26,750 INFO L78 Accepts]: Start accepts. Automaton has 80706 states and 87130 transitions. Word has length 384 [2025-02-05 11:47:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 80706 states and 87130 transitions. [2025-02-05 11:47:26,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 80706 states and 87130 transitions. [2025-02-05 11:47:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-02-05 11:47:26,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:26,755 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:26,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:47:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:26,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:26,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash -89733379, now seen corresponding path program 1 times [2025-02-05 11:47:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:26,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742878569] [2025-02-05 11:47:26,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:26,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-02-05 11:47:26,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-02-05 11:47:26,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:47:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742878569] [2025-02-05 11:47:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742878569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:27,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970597297] [2025-02-05 11:47:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:27,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:27,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:27,263 INFO L87 Difference]: Start difference. First operand 80706 states and 87130 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:30,111 INFO L93 Difference]: Finished difference Result 187388 states and 204118 transitions. [2025-02-05 11:47:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2025-02-05 11:47:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:30,227 INFO L225 Difference]: With dead ends: 187388 [2025-02-05 11:47:30,227 INFO L226 Difference]: Without dead ends: 107471 [2025-02-05 11:47:30,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:30,265 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 876 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:30,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 903 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:47:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107471 states. [2025-02-05 11:47:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107471 to 105091. [2025-02-05 11:47:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105091 states, 105090 states have (on average 1.0853839566086212) internal successors, (114063), 105090 states have internal predecessors, (114063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105091 states to 105091 states and 114063 transitions. [2025-02-05 11:47:31,400 INFO L78 Accepts]: Start accepts. Automaton has 105091 states and 114063 transitions. Word has length 414 [2025-02-05 11:47:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:31,400 INFO L471 AbstractCegarLoop]: Abstraction has 105091 states and 114063 transitions. [2025-02-05 11:47:31,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 105091 states and 114063 transitions. [2025-02-05 11:47:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 11:47:31,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:31,406 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:31,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:47:31,406 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:31,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash -643724265, now seen corresponding path program 1 times [2025-02-05 11:47:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341442298] [2025-02-05 11:47:31,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 11:47:31,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 11:47:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-02-05 11:47:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341442298] [2025-02-05 11:47:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341442298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865469133] [2025-02-05 11:47:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:31,584 INFO L87 Difference]: Start difference. First operand 105091 states and 114063 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:34,786 INFO L93 Difference]: Finished difference Result 222864 states and 242086 transitions. [2025-02-05 11:47:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2025-02-05 11:47:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:34,923 INFO L225 Difference]: With dead ends: 222864 [2025-02-05 11:47:34,923 INFO L226 Difference]: Without dead ends: 129581 [2025-02-05 11:47:34,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:34,970 INFO L435 NwaCegarLoop]: 1888 mSDtfsCounter, 896 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:34,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 2060 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:47:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129581 states. [2025-02-05 11:47:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129581 to 123265. [2025-02-05 11:47:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123265 states, 123264 states have (on average 1.080721053997923) internal successors, (133214), 123264 states have internal predecessors, (133214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123265 states to 123265 states and 133214 transitions. [2025-02-05 11:47:36,248 INFO L78 Accepts]: Start accepts. Automaton has 123265 states and 133214 transitions. Word has length 447 [2025-02-05 11:47:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:36,249 INFO L471 AbstractCegarLoop]: Abstraction has 123265 states and 133214 transitions. [2025-02-05 11:47:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 123265 states and 133214 transitions. [2025-02-05 11:47:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-02-05 11:47:36,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:36,255 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:36,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:47:36,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1215982767, now seen corresponding path program 1 times [2025-02-05 11:47:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894843146] [2025-02-05 11:47:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:36,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-05 11:47:36,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-05 11:47:36,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:36,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:47:36,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:36,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894843146] [2025-02-05 11:47:36,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894843146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:36,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942195852] [2025-02-05 11:47:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:36,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:36,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:36,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:36,423 INFO L87 Difference]: Start difference. First operand 123265 states and 133214 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:39,668 INFO L93 Difference]: Finished difference Result 278815 states and 303025 transitions. [2025-02-05 11:47:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 452 [2025-02-05 11:47:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:39,859 INFO L225 Difference]: With dead ends: 278815 [2025-02-05 11:47:39,859 INFO L226 Difference]: Without dead ends: 152404 [2025-02-05 11:47:39,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:39,922 INFO L435 NwaCegarLoop]: 1739 mSDtfsCounter, 785 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:39,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1882 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:47:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152404 states. [2025-02-05 11:47:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152404 to 150809. [2025-02-05 11:47:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150809 states, 150808 states have (on average 1.0705997029335315) internal successors, (161455), 150808 states have internal predecessors, (161455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150809 states to 150809 states and 161455 transitions. [2025-02-05 11:47:41,509 INFO L78 Accepts]: Start accepts. Automaton has 150809 states and 161455 transitions. Word has length 452 [2025-02-05 11:47:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:41,509 INFO L471 AbstractCegarLoop]: Abstraction has 150809 states and 161455 transitions. [2025-02-05 11:47:41,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 150809 states and 161455 transitions. [2025-02-05 11:47:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 11:47:41,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:41,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:47:41,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 980753690, now seen corresponding path program 1 times [2025-02-05 11:47:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158303137] [2025-02-05 11:47:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 11:47:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 11:47:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:41,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 11:47:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158303137] [2025-02-05 11:47:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158303137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352418996] [2025-02-05 11:47:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:42,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:47:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:42,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:47:42,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:42,077 INFO L87 Difference]: Start difference. First operand 150809 states and 161455 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:46,766 INFO L93 Difference]: Finished difference Result 333143 states and 358486 transitions. [2025-02-05 11:47:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:47:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2025-02-05 11:47:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:46,993 INFO L225 Difference]: With dead ends: 333143 [2025-02-05 11:47:46,994 INFO L226 Difference]: Without dead ends: 198869 [2025-02-05 11:47:47,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:47,037 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 1462 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5280 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 6098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 5280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:47,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 885 Invalid, 6098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 5280 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:47:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198869 states. [2025-02-05 11:47:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198869 to 178375. [2025-02-05 11:47:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178375 states, 178374 states have (on average 1.0696514065951315) internal successors, (190798), 178374 states have internal predecessors, (190798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178375 states to 178375 states and 190798 transitions. [2025-02-05 11:47:49,018 INFO L78 Accepts]: Start accepts. Automaton has 178375 states and 190798 transitions. Word has length 462 [2025-02-05 11:47:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 178375 states and 190798 transitions. [2025-02-05 11:47:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 178375 states and 190798 transitions. [2025-02-05 11:47:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-05 11:47:49,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:49,030 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:47:49,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash -227930414, now seen corresponding path program 1 times [2025-02-05 11:47:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848098695] [2025-02-05 11:47:49,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-05 11:47:49,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-05 11:47:49,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:49,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 352 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 11:47:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848098695] [2025-02-05 11:47:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848098695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:47:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095849815] [2025-02-05 11:47:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:50,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:50,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:50,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:47:50,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:47:50,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-05 11:47:50,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-05 11:47:50,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:50,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:50,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:47:50,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:47:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 11:47:50,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:47:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095849815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:47:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:47:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227697030] [2025-02-05 11:47:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:50,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:50,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:50,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:47:50,285 INFO L87 Difference]: Start difference. First operand 178375 states and 190798 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:53,667 INFO L93 Difference]: Finished difference Result 370897 states and 397145 transitions. [2025-02-05 11:47:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474 [2025-02-05 11:47:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:53,926 INFO L225 Difference]: With dead ends: 370897 [2025-02-05 11:47:53,926 INFO L226 Difference]: Without dead ends: 205116 [2025-02-05 11:47:54,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:47:54,002 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 949 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:54,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1689 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:47:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205116 states. [2025-02-05 11:47:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205116 to 193278. [2025-02-05 11:47:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193278 states, 193277 states have (on average 1.0656104968516689) internal successors, (205958), 193277 states have internal predecessors, (205958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193278 states to 193278 states and 205958 transitions. [2025-02-05 11:47:56,198 INFO L78 Accepts]: Start accepts. Automaton has 193278 states and 205958 transitions. Word has length 474 [2025-02-05 11:47:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:56,198 INFO L471 AbstractCegarLoop]: Abstraction has 193278 states and 205958 transitions. [2025-02-05 11:47:56,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 193278 states and 205958 transitions. [2025-02-05 11:47:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-05 11:47:56,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:56,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:56,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:47:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:56,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 443826203, now seen corresponding path program 1 times [2025-02-05 11:47:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871431259] [2025-02-05 11:47:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:56,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 11:47:56,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 11:47:56,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat