./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:12:08,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:12:08,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:12:08,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:12:08,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:12:08,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:12:08,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:12:08,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:12:08,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:12:08,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:12:08,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:12:08,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:12:08,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:12:08,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:12:08,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:12:08,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:12:08,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:12:08,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:12:08,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:12:08,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:12:08,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:12:08,458 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 [2025-02-05 20:12:08,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:12:08,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:12:08,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:12:08,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:12:08,739 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:12:08,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-02-05 20:12:10,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7973e327/02e1b64df0474c08af92a65e5fa4c908/FLAG7b395f0f7 [2025-02-05 20:12:10,325 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:12:10,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-02-05 20:12:10,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7973e327/02e1b64df0474c08af92a65e5fa4c908/FLAG7b395f0f7 [2025-02-05 20:12:10,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7973e327/02e1b64df0474c08af92a65e5fa4c908 [2025-02-05 20:12:10,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:12:10,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:12:10,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:12:10,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:12:10,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:12:10,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7042b451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10, skipping insertion in model container [2025-02-05 20:12:10,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:12:10,521 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c[1255,1268] [2025-02-05 20:12:10,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:12:10,648 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:12:10,658 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c[1255,1268] [2025-02-05 20:12:10,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:12:10,750 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:12:10,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10 WrapperNode [2025-02-05 20:12:10,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:12:10,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:12:10,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:12:10,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:12:10,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,875 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 516 [2025-02-05 20:12:10,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:12:10,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:12:10,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:12:10,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:12:10,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,923 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 20:12:10,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:12:10,991 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:12:10,991 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:12:10,991 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:12:10,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (1/1) ... [2025-02-05 20:12:10,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:12:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:11,025 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 20:12:11,028 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 20:12:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:12:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:12:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:12:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:12:11,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:12:11,163 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:12:11,905 INFO L? ?]: Removed 314 outVars from TransFormulas that were not future-live. [2025-02-05 20:12:11,905 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:12:11,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:12:11,954 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:12:11,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:12:11 BoogieIcfgContainer [2025-02-05 20:12:11,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:12:11,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:12:11,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:12:11,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:12:11,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:12:10" (1/3) ... [2025-02-05 20:12:11,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c70be5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:12:11, skipping insertion in model container [2025-02-05 20:12:11,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:12:10" (2/3) ... [2025-02-05 20:12:11,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c70be5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:12:11, skipping insertion in model container [2025-02-05 20:12:11,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:12:11" (3/3) ... [2025-02-05 20:12:11,963 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-02-05 20:12:11,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:12:11,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:12:12,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:12:12,046 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;@7df59837, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:12:12,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:12:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 20:12:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:12:12,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:12,061 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] [2025-02-05 20:12:12,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:12,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1185105561, now seen corresponding path program 1 times [2025-02-05 20:12:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:12,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685065161] [2025-02-05 20:12:12,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:12:12,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:12:12,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:12,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:12,747 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 20:12:12,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685065161] [2025-02-05 20:12:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685065161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:12,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:12:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012084856] [2025-02-05 20:12:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:12,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:12:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:12,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:12:12,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:12:12,775 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:12:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:12,909 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2025-02-05 20:12:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:12:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2025-02-05 20:12:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:12,917 INFO L225 Difference]: With dead ends: 233 [2025-02-05 20:12:12,917 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 20:12:12,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:12:12,921 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:12,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 20:12:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-05 20:12:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 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 20:12:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2025-02-05 20:12:12,951 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 45 [2025-02-05 20:12:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:12,952 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2025-02-05 20:12:12,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:12:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2025-02-05 20:12:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 20:12:12,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:12,953 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] [2025-02-05 20:12:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:12:12,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:12,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1921112488, now seen corresponding path program 1 times [2025-02-05 20:12:12,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:12,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025088910] [2025-02-05 20:12:12,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:12,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:12,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 20:12:13,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 20:12:13,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:13,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:13,206 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 20:12:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025088910] [2025-02-05 20:12:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025088910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:12:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212381556] [2025-02-05 20:12:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:13,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:12:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:13,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:12:13,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:12:13,211 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 20:12:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:13,327 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2025-02-05 20:12:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:12:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-02-05 20:12:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:13,330 INFO L225 Difference]: With dead ends: 234 [2025-02-05 20:12:13,331 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 20:12:13,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:12:13,332 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:13,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 20:12:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-05 20:12:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 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 20:12:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2025-02-05 20:12:13,345 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 46 [2025-02-05 20:12:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2025-02-05 20:12:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 20:12:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2025-02-05 20:12:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 20:12:13,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:13,347 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] [2025-02-05 20:12:13,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:12:13,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1356454274, now seen corresponding path program 1 times [2025-02-05 20:12:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082409382] [2025-02-05 20:12:13,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:13,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 20:12:13,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 20:12:13,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:13,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:13,799 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 20:12:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082409382] [2025-02-05 20:12:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082409382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:13,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486430174] [2025-02-05 20:12:13,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:13,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:13,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:13,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:13,801 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:12:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:13,978 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2025-02-05 20:12:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:12:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2025-02-05 20:12:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:13,981 INFO L225 Difference]: With dead ends: 241 [2025-02-05 20:12:13,981 INFO L226 Difference]: Without dead ends: 136 [2025-02-05 20:12:13,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:13,982 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:13,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 743 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:12:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-05 20:12:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-05 20:12:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4592592592592593) internal successors, (197), 135 states have internal predecessors, (197), 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 20:12:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-02-05 20:12:14,002 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 47 [2025-02-05 20:12:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-02-05 20:12:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:12:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-02-05 20:12:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 20:12:14,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:14,004 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] [2025-02-05 20:12:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:12:14,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 988772109, now seen corresponding path program 1 times [2025-02-05 20:12:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121708839] [2025-02-05 20:12:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:14,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:12:14,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:12:14,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:14,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:14,264 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 20:12:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121708839] [2025-02-05 20:12:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121708839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898121244] [2025-02-05 20:12:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:14,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:14,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:14,268 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 20:12:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:14,432 INFO L93 Difference]: Finished difference Result 257 states and 373 transitions. [2025-02-05 20:12:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 48 [2025-02-05 20:12:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:14,433 INFO L225 Difference]: With dead ends: 257 [2025-02-05 20:12:14,433 INFO L226 Difference]: Without dead ends: 147 [2025-02-05 20:12:14,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:14,434 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:14,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 887 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:12:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-05 20:12:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-05 20:12:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 146 states have internal predecessors, (211), 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 20:12:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 211 transitions. [2025-02-05 20:12:14,446 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 211 transitions. Word has length 48 [2025-02-05 20:12:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:14,447 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 211 transitions. [2025-02-05 20:12:14,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 20:12:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2025-02-05 20:12:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 20:12:14,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:14,450 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] [2025-02-05 20:12:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:12:14,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1820515342, now seen corresponding path program 1 times [2025-02-05 20:12:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555071672] [2025-02-05 20:12:14,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:12:14,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:12:14,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:14,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:14,625 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 20:12:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555071672] [2025-02-05 20:12:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555071672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050654733] [2025-02-05 20:12:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:14,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:14,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:14,627 INFO L87 Difference]: Start difference. First operand 147 states and 211 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 20:12:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:14,779 INFO L93 Difference]: Finished difference Result 363 states and 519 transitions. [2025-02-05 20:12:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2025-02-05 20:12:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:14,781 INFO L225 Difference]: With dead ends: 363 [2025-02-05 20:12:14,781 INFO L226 Difference]: Without dead ends: 242 [2025-02-05 20:12:14,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:14,785 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 391 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-05 20:12:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2025-02-05 20:12:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 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 20:12:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2025-02-05 20:12:14,795 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 48 [2025-02-05 20:12:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:14,795 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2025-02-05 20:12:14,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 20:12:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2025-02-05 20:12:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 20:12:14,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:14,796 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] [2025-02-05 20:12:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:12:14,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1537238936, now seen corresponding path program 1 times [2025-02-05 20:12:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085340279] [2025-02-05 20:12:14,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:12:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:12:14,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:14,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:14,990 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 20:12:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085340279] [2025-02-05 20:12:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085340279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:14,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921037611] [2025-02-05 20:12:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:14,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:14,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:14,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:14,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:14,991 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 20:12:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:15,167 INFO L93 Difference]: Finished difference Result 353 states and 507 transitions. [2025-02-05 20:12:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 49 [2025-02-05 20:12:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:15,169 INFO L225 Difference]: With dead ends: 353 [2025-02-05 20:12:15,169 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 20:12:15,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:15,171 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:15,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 887 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:12:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 20:12:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-05 20:12:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.427906976744186) internal successors, (307), 215 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 20:12:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 307 transitions. [2025-02-05 20:12:15,187 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 307 transitions. Word has length 49 [2025-02-05 20:12:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:15,188 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 307 transitions. [2025-02-05 20:12:15,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 20:12:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 307 transitions. [2025-02-05 20:12:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 20:12:15,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:15,192 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] [2025-02-05 20:12:15,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:12:15,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:15,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1535377875, now seen corresponding path program 1 times [2025-02-05 20:12:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292199949] [2025-02-05 20:12:15,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:15,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:12:15,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:12:15,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:15,330 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 20:12:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292199949] [2025-02-05 20:12:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292199949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:15,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:15,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737290843] [2025-02-05 20:12:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:15,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:15,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:15,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:15,333 INFO L87 Difference]: Start difference. First operand 216 states and 307 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 20:12:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:15,469 INFO L93 Difference]: Finished difference Result 390 states and 549 transitions. [2025-02-05 20:12:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:15,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2025-02-05 20:12:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:15,471 INFO L225 Difference]: With dead ends: 390 [2025-02-05 20:12:15,471 INFO L226 Difference]: Without dead ends: 246 [2025-02-05 20:12:15,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:15,472 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 359 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:15,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-05 20:12:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 206. [2025-02-05 20:12:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.4195121951219511) internal successors, (291), 205 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 20:12:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2025-02-05 20:12:15,485 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 49 [2025-02-05 20:12:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:15,485 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2025-02-05 20:12:15,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 20:12:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2025-02-05 20:12:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 20:12:15,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:15,489 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] [2025-02-05 20:12:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:12:15,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:15,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1693855095, now seen corresponding path program 1 times [2025-02-05 20:12:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327471387] [2025-02-05 20:12:15,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:15,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:12:15,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:12:15,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:15,668 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 20:12:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327471387] [2025-02-05 20:12:15,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327471387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456820803] [2025-02-05 20:12:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:15,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:15,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:15,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:15,670 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 20:12:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:15,837 INFO L93 Difference]: Finished difference Result 385 states and 543 transitions. [2025-02-05 20:12:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:15,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-02-05 20:12:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:15,839 INFO L225 Difference]: With dead ends: 385 [2025-02-05 20:12:15,839 INFO L226 Difference]: Without dead ends: 228 [2025-02-05 20:12:15,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:15,840 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:15,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 887 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:12:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-05 20:12:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-02-05 20:12:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4052863436123348) internal successors, (319), 227 states have internal predecessors, (319), 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 20:12:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2025-02-05 20:12:15,847 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 319 transitions. Word has length 50 [2025-02-05 20:12:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:15,848 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 319 transitions. [2025-02-05 20:12:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 20:12:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 319 transitions. [2025-02-05 20:12:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 20:12:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:15,849 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] [2025-02-05 20:12:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:12:15,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash 166772764, now seen corresponding path program 1 times [2025-02-05 20:12:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898074994] [2025-02-05 20:12:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:12:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:12:15,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:15,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:15,973 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 20:12:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898074994] [2025-02-05 20:12:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898074994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:15,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741786818] [2025-02-05 20:12:15,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:15,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:15,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:15,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:15,974 INFO L87 Difference]: Start difference. First operand 228 states and 319 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:12:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:16,114 INFO L93 Difference]: Finished difference Result 428 states and 595 transitions. [2025-02-05 20:12:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:16,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2025-02-05 20:12:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:16,116 INFO L225 Difference]: With dead ends: 428 [2025-02-05 20:12:16,116 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 20:12:16,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:16,118 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 375 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:16,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 20:12:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 218. [2025-02-05 20:12:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.3963133640552996) internal successors, (303), 217 states have internal predecessors, (303), 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 20:12:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2025-02-05 20:12:16,127 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 50 [2025-02-05 20:12:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2025-02-05 20:12:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:12:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2025-02-05 20:12:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 20:12:16,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:16,129 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] [2025-02-05 20:12:16,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:12:16,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -394239703, now seen corresponding path program 1 times [2025-02-05 20:12:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496920488] [2025-02-05 20:12:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 20:12:16,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 20:12:16,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:16,261 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 20:12:16,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496920488] [2025-02-05 20:12:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496920488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:16,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31176178] [2025-02-05 20:12:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:16,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:16,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:16,263 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 20:12:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:16,385 INFO L93 Difference]: Finished difference Result 411 states and 565 transitions. [2025-02-05 20:12:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:16,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2025-02-05 20:12:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:16,387 INFO L225 Difference]: With dead ends: 411 [2025-02-05 20:12:16,387 INFO L226 Difference]: Without dead ends: 244 [2025-02-05 20:12:16,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:16,388 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:16,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-05 20:12:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212. [2025-02-05 20:12:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.3886255924170616) internal successors, (293), 211 states have internal predecessors, (293), 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 20:12:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 293 transitions. [2025-02-05 20:12:16,394 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 293 transitions. Word has length 51 [2025-02-05 20:12:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 293 transitions. [2025-02-05 20:12:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 20:12:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 293 transitions. [2025-02-05 20:12:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 20:12:16,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:16,395 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] [2025-02-05 20:12:16,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:12:16,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:16,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1142953134, now seen corresponding path program 1 times [2025-02-05 20:12:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:16,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979268463] [2025-02-05 20:12:16,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:16,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 20:12:16,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 20:12:16,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:16,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:16,549 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 20:12:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979268463] [2025-02-05 20:12:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979268463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195796055] [2025-02-05 20:12:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:16,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:16,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:16,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:16,551 INFO L87 Difference]: Start difference. First operand 212 states and 293 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 20:12:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:16,696 INFO L93 Difference]: Finished difference Result 401 states and 552 transitions. [2025-02-05 20:12:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2025-02-05 20:12:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:16,697 INFO L225 Difference]: With dead ends: 401 [2025-02-05 20:12:16,698 INFO L226 Difference]: Without dead ends: 230 [2025-02-05 20:12:16,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:16,698 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:16,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 887 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-05 20:12:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-05 20:12:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3755458515283843) internal successors, (315), 229 states have internal predecessors, (315), 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 20:12:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 315 transitions. [2025-02-05 20:12:16,705 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 315 transitions. Word has length 51 [2025-02-05 20:12:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:16,705 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 315 transitions. [2025-02-05 20:12:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 20:12:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 315 transitions. [2025-02-05 20:12:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:12:16,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:16,706 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] [2025-02-05 20:12:16,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:12:16,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1846787398, now seen corresponding path program 1 times [2025-02-05 20:12:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139201305] [2025-02-05 20:12:16,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:12:16,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:12:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:16,831 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 20:12:16,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139201305] [2025-02-05 20:12:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139201305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470089672] [2025-02-05 20:12:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:16,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:16,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:16,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:16,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:16,833 INFO L87 Difference]: Start difference. First operand 230 states and 315 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 20:12:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:16,959 INFO L93 Difference]: Finished difference Result 459 states and 625 transitions. [2025-02-05 20:12:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2025-02-05 20:12:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:16,961 INFO L225 Difference]: With dead ends: 459 [2025-02-05 20:12:16,961 INFO L226 Difference]: Without dead ends: 272 [2025-02-05 20:12:16,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:16,962 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 359 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:16,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-05 20:12:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 224. [2025-02-05 20:12:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3677130044843049) internal successors, (305), 223 states have internal predecessors, (305), 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 20:12:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 305 transitions. [2025-02-05 20:12:16,968 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 305 transitions. Word has length 52 [2025-02-05 20:12:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:16,968 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 305 transitions. [2025-02-05 20:12:16,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 20:12:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 305 transitions. [2025-02-05 20:12:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:12:16,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:16,969 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] [2025-02-05 20:12:16,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:12:16,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash -733973279, now seen corresponding path program 1 times [2025-02-05 20:12:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:16,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646689529] [2025-02-05 20:12:16,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:12:16,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:12:16,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:16,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:17,068 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 20:12:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:17,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646689529] [2025-02-05 20:12:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646689529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:17,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164902135] [2025-02-05 20:12:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:17,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:17,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:17,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:17,072 INFO L87 Difference]: Start difference. First operand 224 states and 305 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 20:12:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:17,176 INFO L93 Difference]: Finished difference Result 418 states and 568 transitions. [2025-02-05 20:12:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2025-02-05 20:12:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:17,178 INFO L225 Difference]: With dead ends: 418 [2025-02-05 20:12:17,178 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 20:12:17,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:17,178 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 4 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:17,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 607 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 20:12:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-02-05 20:12:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 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 20:12:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 319 transitions. [2025-02-05 20:12:17,191 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 319 transitions. Word has length 52 [2025-02-05 20:12:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:17,191 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 319 transitions. [2025-02-05 20:12:17,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 20:12:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 319 transitions. [2025-02-05 20:12:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 20:12:17,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:17,192 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] [2025-02-05 20:12:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:12:17,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:17,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1158184764, now seen corresponding path program 1 times [2025-02-05 20:12:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:17,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401718074] [2025-02-05 20:12:17,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 20:12:17,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 20:12:17,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:17,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:17,306 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 20:12:17,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401718074] [2025-02-05 20:12:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401718074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:17,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:17,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816842471] [2025-02-05 20:12:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:17,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:17,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:17,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:17,309 INFO L87 Difference]: Start difference. First operand 236 states and 319 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 20:12:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:17,429 INFO L93 Difference]: Finished difference Result 437 states and 591 transitions. [2025-02-05 20:12:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-02-05 20:12:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:17,432 INFO L225 Difference]: With dead ends: 437 [2025-02-05 20:12:17,433 INFO L226 Difference]: Without dead ends: 237 [2025-02-05 20:12:17,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:17,434 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 289 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:17,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:12:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-05 20:12:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 212. [2025-02-05 20:12:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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 20:12:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2025-02-05 20:12:17,444 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 53 [2025-02-05 20:12:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:17,444 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2025-02-05 20:12:17,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 20:12:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2025-02-05 20:12:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 20:12:17,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:17,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:12:17,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2047262066, now seen corresponding path program 1 times [2025-02-05 20:12:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418585841] [2025-02-05 20:12:17,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:17,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:12:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:12:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418585841] [2025-02-05 20:12:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418585841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718645648] [2025-02-05 20:12:19,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:19,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:19,501 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 20:12:19,503 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 20:12:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 20:12:19,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 20:12:19,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:19,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:19,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-05 20:12:19,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:21,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718645648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:23,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 21] total 49 [2025-02-05 20:12:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063084568] [2025-02-05 20:12:23,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:23,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 20:12:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:23,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 20:12:23,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 20:12:23,964 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 49 states, 49 states have (on average 5.73469387755102) internal successors, (281), 49 states have internal predecessors, (281), 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 20:12:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:27,433 INFO L93 Difference]: Finished difference Result 628 states and 859 transitions. [2025-02-05 20:12:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 20:12:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.73469387755102) internal successors, (281), 49 states have internal predecessors, (281), 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 99 [2025-02-05 20:12:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:27,437 INFO L225 Difference]: With dead ends: 628 [2025-02-05 20:12:27,437 INFO L226 Difference]: Without dead ends: 466 [2025-02-05 20:12:27,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1081, Invalid=7849, Unknown=0, NotChecked=0, Total=8930 [2025-02-05 20:12:27,445 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1331 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:27,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2454 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 20:12:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-05 20:12:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 359. [2025-02-05 20:12:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.3519553072625698) internal successors, (484), 358 states have internal predecessors, (484), 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 20:12:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-02-05 20:12:27,455 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 99 [2025-02-05 20:12:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:27,455 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-02-05 20:12:27,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.73469387755102) internal successors, (281), 49 states have internal predecessors, (281), 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 20:12:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-02-05 20:12:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 20:12:27,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:27,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:27,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:12:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 20:12:27,658 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:27,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1177393235, now seen corresponding path program 1 times [2025-02-05 20:12:27,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373950409] [2025-02-05 20:12:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:12:27,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:12:27,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373950409] [2025-02-05 20:12:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373950409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233144064] [2025-02-05 20:12:29,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:29,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:29,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:29,109 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 20:12:29,112 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 20:12:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:12:29,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:12:29,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:29,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:29,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-02-05 20:12:29,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:31,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233144064] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:33,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 22] total 49 [2025-02-05 20:12:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112159962] [2025-02-05 20:12:33,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 20:12:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:33,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 20:12:33,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2118, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 20:12:33,174 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 49 states, 49 states have (on average 5.6938775510204085) internal successors, (279), 49 states have internal predecessors, (279), 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 20:12:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:36,419 INFO L93 Difference]: Finished difference Result 1060 states and 1447 transitions. [2025-02-05 20:12:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 20:12:36,420 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.6938775510204085) internal successors, (279), 49 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 20:12:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:36,423 INFO L225 Difference]: With dead ends: 1060 [2025-02-05 20:12:36,423 INFO L226 Difference]: Without dead ends: 783 [2025-02-05 20:12:36,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2661 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=888, Invalid=8042, Unknown=0, NotChecked=0, Total=8930 [2025-02-05 20:12:36,427 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1251 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 3582 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 3607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:36,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 3342 Invalid, 3607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3582 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:12:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-05 20:12:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 598. [2025-02-05 20:12:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3651591289782246) internal successors, (815), 597 states have internal predecessors, (815), 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 20:12:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 815 transitions. [2025-02-05 20:12:36,444 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 815 transitions. Word has length 100 [2025-02-05 20:12:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:36,445 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 815 transitions. [2025-02-05 20:12:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.6938775510204085) internal successors, (279), 49 states have internal predecessors, (279), 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 20:12:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 815 transitions. [2025-02-05 20:12:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 20:12:36,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:36,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:36,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:12:36,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 20:12:36,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:36,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash 511257364, now seen corresponding path program 1 times [2025-02-05 20:12:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731816894] [2025-02-05 20:12:36,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:36,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:12:36,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:12:36,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:36,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:37,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731816894] [2025-02-05 20:12:37,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731816894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:37,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396244737] [2025-02-05 20:12:37,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:37,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:37,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:37,819 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 20:12:37,821 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 20:12:37,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 20:12:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 20:12:38,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:38,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:38,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 20:12:38,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:38,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396244737] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:39,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 33 [2025-02-05 20:12:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296387893] [2025-02-05 20:12:39,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:39,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 20:12:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:39,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 20:12:39,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 20:12:39,694 INFO L87 Difference]: Start difference. First operand 598 states and 815 transitions. Second operand has 33 states, 33 states have (on average 8.606060606060606) internal successors, (284), 33 states have internal predecessors, (284), 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 20:12:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:41,601 INFO L93 Difference]: Finished difference Result 2223 states and 3037 transitions. [2025-02-05 20:12:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 20:12:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.606060606060606) internal successors, (284), 33 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 20:12:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:41,609 INFO L225 Difference]: With dead ends: 2223 [2025-02-05 20:12:41,609 INFO L226 Difference]: Without dead ends: 1776 [2025-02-05 20:12:41,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=456, Invalid=2736, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 20:12:41,611 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1166 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:41,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 4410 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:12:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-02-05 20:12:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 968. [2025-02-05 20:12:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.3526370217166495) internal successors, (1308), 967 states have internal predecessors, (1308), 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 20:12:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1308 transitions. [2025-02-05 20:12:41,635 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1308 transitions. Word has length 100 [2025-02-05 20:12:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1308 transitions. [2025-02-05 20:12:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.606060606060606) internal successors, (284), 33 states have internal predecessors, (284), 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 20:12:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1308 transitions. [2025-02-05 20:12:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 20:12:41,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:41,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:41,648 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 20:12:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:41,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1954150812, now seen corresponding path program 1 times [2025-02-05 20:12:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207719431] [2025-02-05 20:12:41,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:42,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:42,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:42,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207719431] [2025-02-05 20:12:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207719431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111984591] [2025-02-05 20:12:43,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:43,129 INFO L229 MonitoredProcess]: Starting monitored process 5 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 20:12:43,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:12:43,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:43,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:43,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:43,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:43,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 20:12:43,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:44,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111984591] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:45,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 21] total 46 [2025-02-05 20:12:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419372689] [2025-02-05 20:12:45,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-05 20:12:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:45,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-05 20:12:45,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1855, Unknown=0, NotChecked=0, Total=2070 [2025-02-05 20:12:45,877 INFO L87 Difference]: Start difference. First operand 968 states and 1308 transitions. Second operand has 46 states, 46 states have (on average 6.217391304347826) internal successors, (286), 46 states have internal predecessors, (286), 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 20:12:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:49,964 INFO L93 Difference]: Finished difference Result 3083 states and 4202 transitions. [2025-02-05 20:12:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-02-05 20:12:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.217391304347826) internal successors, (286), 46 states have internal predecessors, (286), 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 101 [2025-02-05 20:12:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:49,970 INFO L225 Difference]: With dead ends: 3083 [2025-02-05 20:12:49,971 INFO L226 Difference]: Without dead ends: 2124 [2025-02-05 20:12:49,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3272 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1838, Invalid=11968, Unknown=0, NotChecked=0, Total=13806 [2025-02-05 20:12:49,976 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 2084 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:49,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 2888 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3069 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:12:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-02-05 20:12:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1777. [2025-02-05 20:12:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1776 states have (on average 1.3338963963963963) internal successors, (2369), 1776 states have internal predecessors, (2369), 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 20:12:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2369 transitions. [2025-02-05 20:12:50,020 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2369 transitions. Word has length 101 [2025-02-05 20:12:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2369 transitions. [2025-02-05 20:12:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.217391304347826) internal successors, (286), 46 states have internal predecessors, (286), 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 20:12:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2369 transitions. [2025-02-05 20:12:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 20:12:50,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:50,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:50,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:12:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 20:12:50,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:50,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash 805887729, now seen corresponding path program 1 times [2025-02-05 20:12:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541692130] [2025-02-05 20:12:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:50,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:50,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:50,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:50,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541692130] [2025-02-05 20:12:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541692130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073293190] [2025-02-05 20:12:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:51,030 INFO L229 MonitoredProcess]: Starting monitored process 6 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 20:12:51,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:12:51,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:51,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:51,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:51,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 20:12:51,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:51,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073293190] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:52,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 31 [2025-02-05 20:12:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065922463] [2025-02-05 20:12:52,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:52,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 20:12:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 20:12:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-02-05 20:12:52,800 INFO L87 Difference]: Start difference. First operand 1777 states and 2369 transitions. Second operand has 31 states, 31 states have (on average 9.096774193548388) internal successors, (282), 31 states have internal predecessors, (282), 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 20:12:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:54,414 INFO L93 Difference]: Finished difference Result 3533 states and 4721 transitions. [2025-02-05 20:12:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 20:12:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.096774193548388) internal successors, (282), 31 states have internal predecessors, (282), 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 101 [2025-02-05 20:12:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:54,422 INFO L225 Difference]: With dead ends: 3533 [2025-02-05 20:12:54,422 INFO L226 Difference]: Without dead ends: 2275 [2025-02-05 20:12:54,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 20:12:54,424 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 602 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 3640 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:54,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 3640 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:12:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-02-05 20:12:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1729. [2025-02-05 20:12:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.3263888888888888) internal successors, (2292), 1728 states have internal predecessors, (2292), 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 20:12:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2292 transitions. [2025-02-05 20:12:54,460 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2292 transitions. Word has length 101 [2025-02-05 20:12:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:54,461 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2292 transitions. [2025-02-05 20:12:54,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.096774193548388) internal successors, (282), 31 states have internal predecessors, (282), 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 20:12:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2292 transitions. [2025-02-05 20:12:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 20:12:54,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:54,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:54,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 20:12:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:54,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2141577125, now seen corresponding path program 1 times [2025-02-05 20:12:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785471559] [2025-02-05 20:12:54,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:54,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:54,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:54,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:54,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:54,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:56,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:56,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785471559] [2025-02-05 20:12:56,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785471559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:56,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774674574] [2025-02-05 20:12:56,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:56,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:56,181 INFO L229 MonitoredProcess]: Starting monitored process 7 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 20:12:56,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:12:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 20:12:56,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 20:12:56,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:56,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-02-05 20:12:56,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:57,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:12:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774674574] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:12:59,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:12:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 43 [2025-02-05 20:12:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393985853] [2025-02-05 20:12:59,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:12:59,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 20:12:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:59,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 20:12:59,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 20:12:59,458 INFO L87 Difference]: Start difference. First operand 1729 states and 2292 transitions. Second operand has 43 states, 43 states have (on average 6.674418604651163) internal successors, (287), 43 states have internal predecessors, (287), 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 20:13:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:01,512 INFO L93 Difference]: Finished difference Result 3568 states and 4736 transitions. [2025-02-05 20:13:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 20:13:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.674418604651163) internal successors, (287), 43 states have internal predecessors, (287), 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 101 [2025-02-05 20:13:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:01,517 INFO L225 Difference]: With dead ends: 3568 [2025-02-05 20:13:01,517 INFO L226 Difference]: Without dead ends: 2105 [2025-02-05 20:13:01,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=656, Invalid=4456, Unknown=0, NotChecked=0, Total=5112 [2025-02-05 20:13:01,521 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1406 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:01,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 2197 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:13:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-02-05 20:13:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1435. [2025-02-05 20:13:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.3228730822873083) internal successors, (1897), 1434 states have internal predecessors, (1897), 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 20:13:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1897 transitions. [2025-02-05 20:13:01,550 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1897 transitions. Word has length 101 [2025-02-05 20:13:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1897 transitions. [2025-02-05 20:13:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.674418604651163) internal successors, (287), 43 states have internal predecessors, (287), 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 20:13:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1897 transitions. [2025-02-05 20:13:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 20:13:01,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:01,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:13:01,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 20:13:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:01,754 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -820095063, now seen corresponding path program 1 times [2025-02-05 20:13:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795376632] [2025-02-05 20:13:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:01,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 20:13:01,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 20:13:01,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795376632] [2025-02-05 20:13:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795376632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295303794] [2025-02-05 20:13:02,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:02,944 INFO L229 MonitoredProcess]: Starting monitored process 8 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 20:13:02,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:13:03,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 20:13:03,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 20:13:03,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:03,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:03,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 195 conjuncts are in the unsatisfiable core [2025-02-05 20:13:03,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:04,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:13:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295303794] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:13:09,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:13:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 27] total 60 [2025-02-05 20:13:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128721963] [2025-02-05 20:13:09,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:13:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-05 20:13:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:09,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-05 20:13:09,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3127, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 20:13:09,946 INFO L87 Difference]: Start difference. First operand 1435 states and 1897 transitions. Second operand has 60 states, 60 states have (on average 4.583333333333333) internal successors, (275), 60 states have internal predecessors, (275), 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 20:13:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:14,381 INFO L93 Difference]: Finished difference Result 3855 states and 5081 transitions. [2025-02-05 20:13:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-05 20:13:14,381 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 4.583333333333333) internal successors, (275), 60 states have internal predecessors, (275), 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 102 [2025-02-05 20:13:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:14,386 INFO L225 Difference]: With dead ends: 3855 [2025-02-05 20:13:14,386 INFO L226 Difference]: Without dead ends: 2566 [2025-02-05 20:13:14,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1482, Invalid=12560, Unknown=0, NotChecked=0, Total=14042 [2025-02-05 20:13:14,392 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1437 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3684 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:14,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 3347 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3684 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 20:13:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2025-02-05 20:13:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1845. [2025-02-05 20:13:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1844 states have (on average 1.3215835140997831) internal successors, (2437), 1844 states have internal predecessors, (2437), 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 20:13:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2437 transitions. [2025-02-05 20:13:14,444 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2437 transitions. Word has length 102 [2025-02-05 20:13:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:14,444 INFO L471 AbstractCegarLoop]: Abstraction has 1845 states and 2437 transitions. [2025-02-05 20:13:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.583333333333333) internal successors, (275), 60 states have internal predecessors, (275), 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 20:13:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2437 transitions. [2025-02-05 20:13:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 20:13:14,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:14,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:13:14,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 20:13:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:14,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 172397194, now seen corresponding path program 1 times [2025-02-05 20:13:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765466478] [2025-02-05 20:13:14,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:14,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 20:13:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 20:13:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:16,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:13:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765466478] [2025-02-05 20:13:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765466478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:13:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293029135] [2025-02-05 20:13:16,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:13:16,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:16,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:13:16,113 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:13:16,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:13:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 20:13:16,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 20:13:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:13:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:13:16,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-02-05 20:13:16,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:13:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:18,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:13:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:13:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293029135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:13:20,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:13:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 22] total 47 [2025-02-05 20:13:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828750252] [2025-02-05 20:13:20,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:13:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 20:13:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:13:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 20:13:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1923, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 20:13:20,136 INFO L87 Difference]: Start difference. First operand 1845 states and 2437 transitions. Second operand has 47 states, 47 states have (on average 6.0638297872340425) internal successors, (285), 47 states have internal predecessors, (285), 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 20:13:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:13:23,132 INFO L93 Difference]: Finished difference Result 4597 states and 6081 transitions. [2025-02-05 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 20:13:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.0638297872340425) internal successors, (285), 47 states have internal predecessors, (285), 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 102 [2025-02-05 20:13:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:13:23,140 INFO L225 Difference]: With dead ends: 4597 [2025-02-05 20:13:23,140 INFO L226 Difference]: Without dead ends: 3043 [2025-02-05 20:13:23,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=783, Invalid=6527, Unknown=0, NotChecked=0, Total=7310 [2025-02-05 20:13:23,143 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1134 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:13:23,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 3073 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:13:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2025-02-05 20:13:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1881. [2025-02-05 20:13:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.3340425531914895) internal successors, (2508), 1880 states have internal predecessors, (2508), 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 20:13:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2508 transitions. [2025-02-05 20:13:23,178 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2508 transitions. Word has length 102 [2025-02-05 20:13:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:13:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2508 transitions. [2025-02-05 20:13:23,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.0638297872340425) internal successors, (285), 47 states have internal predecessors, (285), 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 20:13:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2508 transitions. [2025-02-05 20:13:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 20:13:23,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:13:23,182 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, 2, 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] [2025-02-05 20:13:23,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:13:23,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:13:23,383 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:13:23,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:13:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -781339662, now seen corresponding path program 2 times [2025-02-05 20:13:23,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:13:23,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410153000] [2025-02-05 20:13:23,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:13:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:13:23,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes.