./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 48c9605d 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-?-48c9605-m [2025-02-08 00:12:20,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:20,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:12:20,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:20,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:20,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:20,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:20,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:20,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:20,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:20,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:20,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:20,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:20,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:20,754 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:20,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:20,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:20,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:20,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:20,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:20,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:20,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:20,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:20,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:20,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:20,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:20,758 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-08 00:12:21,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:21,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:21,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:21,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:21,144 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:21,146 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-08 00:12:22,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f833e664b/915aae327b834520bf7f50bccfcf3fd0/FLAGd92b618ae [2025-02-08 00:12:22,807 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:12:22,808 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-08 00:12:22,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f833e664b/915aae327b834520bf7f50bccfcf3fd0/FLAGd92b618ae [2025-02-08 00:12:22,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f833e664b/915aae327b834520bf7f50bccfcf3fd0 [2025-02-08 00:12:22,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:12:22,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:12:22,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:22,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:12:22,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:12:22,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:22" (1/1) ... [2025-02-08 00:12:22,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166b273e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:22, skipping insertion in model container [2025-02-08 00:12:22,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:22" (1/1) ... [2025-02-08 00:12:22,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:12:23,014 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-08 00:12:23,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:23,145 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:12:23,157 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-08 00:12:23,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:23,238 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:12:23,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23 WrapperNode [2025-02-08 00:12:23,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:23,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:23,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:12:23,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:12:23,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,342 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 516 [2025-02-08 00:12:23,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:23,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:12:23,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:12:23,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:12:23,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,401 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-08 00:12:23,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:12:23,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:12:23,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:12:23,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:12:23,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (1/1) ... [2025-02-08 00:12:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:23,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:23,513 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-08 00:12:23,519 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-08 00:12:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:12:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:12:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:12:23,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:12:23,676 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:12:23,677 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:12:24,420 INFO L? ?]: Removed 312 outVars from TransFormulas that were not future-live. [2025-02-08 00:12:24,420 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:12:24,458 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:12:24,458 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:12:24,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:24 BoogieIcfgContainer [2025-02-08 00:12:24,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:12:24,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:12:24,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:12:24,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:12:24,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:12:22" (1/3) ... [2025-02-08 00:12:24,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51599280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:24, skipping insertion in model container [2025-02-08 00:12:24,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:23" (2/3) ... [2025-02-08 00:12:24,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51599280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:24, skipping insertion in model container [2025-02-08 00:12:24,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:24" (3/3) ... [2025-02-08 00:12:24,467 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-02-08 00:12:24,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:12:24,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c that has 1 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:12:24,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:12:24,553 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;@2c734a22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:12:24,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:12:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 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-08 00:12:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:12:24,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:24,564 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] [2025-02-08 00:12:24,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:24,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash 343290349, now seen corresponding path program 1 times [2025-02-08 00:12:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192748739] [2025-02-08 00:12:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:24,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:12:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:12:24,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:24,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:25,279 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-08 00:12:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192748739] [2025-02-08 00:12:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192748739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602283465] [2025-02-08 00:12:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:25,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:25,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:25,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:25,311 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.5) internal successors, (189), 127 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) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-08 00:12:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:25,451 INFO L93 Difference]: Finished difference Result 231 states and 343 transitions. [2025-02-08 00:12:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-02-08 00:12:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:25,461 INFO L225 Difference]: With dead ends: 231 [2025-02-08 00:12:25,463 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 00:12:25,466 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-08 00:12:25,470 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 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-08 00:12:25,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 00:12:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-08 00:12:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 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-08 00:12:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2025-02-08 00:12:25,510 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 44 [2025-02-08 00:12:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2025-02-08 00:12:25,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-08 00:12:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2025-02-08 00:12:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 00:12:25,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:25,513 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-08 00:12:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:12:25,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2056745440, now seen corresponding path program 1 times [2025-02-08 00:12:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463234516] [2025-02-08 00:12:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:25,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 00:12:25,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 00:12:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:25,741 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-08 00:12:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463234516] [2025-02-08 00:12:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463234516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:25,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171301601] [2025-02-08 00:12:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:25,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:25,747 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. 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-08 00:12:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:25,868 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2025-02-08 00:12:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:25,869 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-08 00:12:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:25,870 INFO L225 Difference]: With dead ends: 233 [2025-02-08 00:12:25,870 INFO L226 Difference]: Without dead ends: 130 [2025-02-08 00:12:25,871 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-08 00:12:25,871 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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-08 00:12:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-08 00:12:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-08 00:12:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 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-08 00:12:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-02-08 00:12:25,887 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 45 [2025-02-08 00:12:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-02-08 00:12:25,887 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-08 00:12:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-02-08 00:12:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 00:12:25,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:25,888 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-08 00:12:25,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:12:25,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1266108488, now seen corresponding path program 1 times [2025-02-08 00:12:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705320991] [2025-02-08 00:12:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 00:12:25,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 00:12:25,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:25,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:26,315 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-08 00:12:26,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705320991] [2025-02-08 00:12:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705320991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433827804] [2025-02-08 00:12:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:26,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:26,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:26,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:26,318 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-08 00:12:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:26,492 INFO L93 Difference]: Finished difference Result 240 states and 351 transitions. [2025-02-08 00:12:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:12:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-08 00:12:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:26,495 INFO L225 Difference]: With dead ends: 240 [2025-02-08 00:12:26,496 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 00:12:26,496 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-08 00:12:26,497 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 738 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-08 00:12:26,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 738 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 00:12:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 00:12:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.462686567164179) internal successors, (196), 134 states have internal predecessors, (196), 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-08 00:12:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2025-02-08 00:12:26,509 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 46 [2025-02-08 00:12:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:26,510 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2025-02-08 00:12:26,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-08 00:12:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2025-02-08 00:12:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:12:26,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:26,513 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-08 00:12:26,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:12:26,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1811947259, now seen corresponding path program 1 times [2025-02-08 00:12:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757639003] [2025-02-08 00:12:26,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:26,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:12:26,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:12:26,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:26,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:26,766 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-08 00:12:26,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:26,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757639003] [2025-02-08 00:12:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757639003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:26,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972160289] [2025-02-08 00:12:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:26,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:26,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:26,769 INFO L87 Difference]: Start difference. First operand 135 states and 196 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-08 00:12:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:26,937 INFO L93 Difference]: Finished difference Result 256 states and 372 transitions. [2025-02-08 00:12:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:26,937 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-08 00:12:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:26,938 INFO L225 Difference]: With dead ends: 256 [2025-02-08 00:12:26,938 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 00:12:26,939 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-08 00:12:26,939 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 5 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 881 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-08 00:12:26,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 881 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 00:12:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-02-08 00:12:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4482758620689655) internal successors, (210), 145 states have internal predecessors, (210), 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-08 00:12:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 210 transitions. [2025-02-08 00:12:26,952 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 210 transitions. Word has length 47 [2025-02-08 00:12:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:26,954 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 210 transitions. [2025-02-08 00:12:26,954 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-08 00:12:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 210 transitions. [2025-02-08 00:12:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:12:26,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:26,955 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-08 00:12:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:12:26,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:26,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -326267414, now seen corresponding path program 1 times [2025-02-08 00:12:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564433772] [2025-02-08 00:12:26,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:26,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:12:26,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:12:26,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:26,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:27,154 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-08 00:12:27,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:27,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564433772] [2025-02-08 00:12:27,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564433772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:27,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:27,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308092318] [2025-02-08 00:12:27,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:27,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:27,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:27,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:27,157 INFO L87 Difference]: Start difference. First operand 146 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 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-08 00:12:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:27,319 INFO L93 Difference]: Finished difference Result 362 states and 518 transitions. [2025-02-08 00:12:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:27,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 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-08 00:12:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:27,321 INFO L225 Difference]: With dead ends: 362 [2025-02-08 00:12:27,321 INFO L226 Difference]: Without dead ends: 241 [2025-02-08 00:12:27,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:27,325 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 391 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 435 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-08 00:12:27,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-08 00:12:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 193. [2025-02-08 00:12:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4479166666666667) internal successors, (278), 192 states have internal predecessors, (278), 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-08 00:12:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 278 transitions. [2025-02-08 00:12:27,344 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 278 transitions. Word has length 47 [2025-02-08 00:12:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 278 transitions. [2025-02-08 00:12:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 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-08 00:12:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 278 transitions. [2025-02-08 00:12:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:12:27,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:27,345 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-08 00:12:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:12:27,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 614284446, now seen corresponding path program 1 times [2025-02-08 00:12:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980782201] [2025-02-08 00:12:27,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:27,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:12:27,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:12:27,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:27,563 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-08 00:12:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980782201] [2025-02-08 00:12:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980782201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799909163] [2025-02-08 00:12:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:27,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:27,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:27,567 INFO L87 Difference]: Start difference. First operand 193 states and 278 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-08 00:12:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:27,758 INFO L93 Difference]: Finished difference Result 352 states and 506 transitions. [2025-02-08 00:12:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:27,758 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-08 00:12:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:27,760 INFO L225 Difference]: With dead ends: 352 [2025-02-08 00:12:27,760 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 00:12:27,760 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-08 00:12:27,761 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 5 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 881 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-08 00:12:27,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 881 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:12:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 00:12:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-08 00:12:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4299065420560748) internal successors, (306), 214 states have internal predecessors, (306), 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-08 00:12:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2025-02-08 00:12:27,772 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 48 [2025-02-08 00:12:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:27,772 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2025-02-08 00:12:27,772 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-08 00:12:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2025-02-08 00:12:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:12:27,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:27,773 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-08 00:12:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:12:27,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash 612423385, now seen corresponding path program 1 times [2025-02-08 00:12:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344988761] [2025-02-08 00:12:27,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:27,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:12:27,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:12:27,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:27,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:27,910 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-08 00:12:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344988761] [2025-02-08 00:12:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344988761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:27,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:27,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358432081] [2025-02-08 00:12:27,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:27,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:27,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:27,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:27,912 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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-08 00:12:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:28,055 INFO L93 Difference]: Finished difference Result 389 states and 548 transitions. [2025-02-08 00:12:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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-08 00:12:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:28,057 INFO L225 Difference]: With dead ends: 389 [2025-02-08 00:12:28,057 INFO L226 Difference]: Without dead ends: 245 [2025-02-08 00:12:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:28,058 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 359 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 435 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-08 00:12:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-08 00:12:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 205. [2025-02-08 00:12:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.4215686274509804) internal successors, (290), 204 states have internal predecessors, (290), 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-08 00:12:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 290 transitions. [2025-02-08 00:12:28,072 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 290 transitions. Word has length 48 [2025-02-08 00:12:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:28,075 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 290 transitions. [2025-02-08 00:12:28,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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-08 00:12:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 290 transitions. [2025-02-08 00:12:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:12:28,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:28,076 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-08 00:12:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:12:28,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1619954644, now seen corresponding path program 1 times [2025-02-08 00:12:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215034694] [2025-02-08 00:12:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:28,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:12:28,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:12:28,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:28,223 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-08 00:12:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215034694] [2025-02-08 00:12:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215034694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355404969] [2025-02-08 00:12:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:28,227 INFO L87 Difference]: Start difference. First operand 205 states and 290 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-08 00:12:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:28,363 INFO L93 Difference]: Finished difference Result 394 states and 552 transitions. [2025-02-08 00:12:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-08 00:12:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:28,365 INFO L225 Difference]: With dead ends: 394 [2025-02-08 00:12:28,365 INFO L226 Difference]: Without dead ends: 247 [2025-02-08 00:12:28,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:28,366 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 375 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 435 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-08 00:12:28,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-08 00:12:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 199. [2025-02-08 00:12:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4141414141414141) internal successors, (280), 198 states have internal predecessors, (280), 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-08 00:12:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions. [2025-02-08 00:12:28,372 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 49 [2025-02-08 00:12:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 280 transitions. [2025-02-08 00:12:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-08 00:12:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions. [2025-02-08 00:12:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:12:28,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:28,373 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-08 00:12:28,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:12:28,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:28,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1147930321, now seen corresponding path program 1 times [2025-02-08 00:12:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:28,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749588387] [2025-02-08 00:12:28,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:12:28,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:12:28,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:28,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:28,556 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-08 00:12:28,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749588387] [2025-02-08 00:12:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749588387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992641332] [2025-02-08 00:12:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:28,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:28,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:28,559 INFO L87 Difference]: Start difference. First operand 199 states and 280 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-08 00:12:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:28,708 INFO L93 Difference]: Finished difference Result 368 states and 515 transitions. [2025-02-08 00:12:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:28,709 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-08 00:12:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:28,710 INFO L225 Difference]: With dead ends: 368 [2025-02-08 00:12:28,710 INFO L226 Difference]: Without dead ends: 217 [2025-02-08 00:12:28,710 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-08 00:12:28,712 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 5 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 881 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-08 00:12:28,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 881 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-08 00:12:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-08 00:12:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3981481481481481) internal successors, (302), 216 states have internal predecessors, (302), 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-08 00:12:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2025-02-08 00:12:28,721 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 49 [2025-02-08 00:12:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:28,721 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2025-02-08 00:12:28,721 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-08 00:12:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2025-02-08 00:12:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:12:28,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:28,722 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-08 00:12:28,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:12:28,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:28,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1704725615, now seen corresponding path program 1 times [2025-02-08 00:12:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765564020] [2025-02-08 00:12:28,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:28,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:12:28,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:12:28,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:28,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:28,838 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-08 00:12:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765564020] [2025-02-08 00:12:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765564020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:28,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594436333] [2025-02-08 00:12:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:28,840 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-08 00:12:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:28,959 INFO L93 Difference]: Finished difference Result 410 states and 564 transitions. [2025-02-08 00:12:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-08 00:12:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:28,961 INFO L225 Difference]: With dead ends: 410 [2025-02-08 00:12:28,961 INFO L226 Difference]: Without dead ends: 243 [2025-02-08 00:12:28,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:28,962 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 319 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 435 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-08 00:12:28,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-08 00:12:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2025-02-08 00:12:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 210 states have internal predecessors, (292), 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-08 00:12:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2025-02-08 00:12:28,973 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 50 [2025-02-08 00:12:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2025-02-08 00:12:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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-08 00:12:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2025-02-08 00:12:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:12:28,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:28,974 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-08 00:12:28,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:12:28,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1053048844, now seen corresponding path program 1 times [2025-02-08 00:12:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440729795] [2025-02-08 00:12:28,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:28,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:28,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:12:29,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:12:29,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:29,140 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-08 00:12:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440729795] [2025-02-08 00:12:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440729795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:12:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656755511] [2025-02-08 00:12:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:12:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:29,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:12:29,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:12:29,142 INFO L87 Difference]: Start difference. First operand 211 states and 292 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-08 00:12:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:29,284 INFO L93 Difference]: Finished difference Result 400 states and 551 transitions. [2025-02-08 00:12:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:12:29,284 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-08 00:12:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:29,285 INFO L225 Difference]: With dead ends: 400 [2025-02-08 00:12:29,285 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 00:12:29,286 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-08 00:12:29,286 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 5 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 881 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-08 00:12:29,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 881 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 00:12:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-08 00:12:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.3771929824561404) internal successors, (314), 228 states have internal predecessors, (314), 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-08 00:12:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2025-02-08 00:12:29,292 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 50 [2025-02-08 00:12:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:29,292 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2025-02-08 00:12:29,293 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-08 00:12:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2025-02-08 00:12:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:12:29,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:29,293 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-08 00:12:29,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:12:29,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:29,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -90557863, now seen corresponding path program 1 times [2025-02-08 00:12:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225274212] [2025-02-08 00:12:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:29,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:12:29,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:12:29,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:29,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:29,385 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-08 00:12:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225274212] [2025-02-08 00:12:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225274212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:12:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309103965] [2025-02-08 00:12:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:29,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:29,386 INFO L87 Difference]: Start difference. First operand 229 states and 314 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-08 00:12:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:29,476 INFO L93 Difference]: Finished difference Result 429 states and 587 transitions. [2025-02-08 00:12:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:29,476 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-08 00:12:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:29,478 INFO L225 Difference]: With dead ends: 429 [2025-02-08 00:12:29,478 INFO L226 Difference]: Without dead ends: 245 [2025-02-08 00:12:29,478 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-08 00:12:29,479 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 603 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-08 00:12:29,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 603 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-08 00:12:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-08 00:12:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 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-08 00:12:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 334 transitions. [2025-02-08 00:12:29,491 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 334 transitions. Word has length 51 [2025-02-08 00:12:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:29,491 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 334 transitions. [2025-02-08 00:12:29,491 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-08 00:12:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 334 transitions. [2025-02-08 00:12:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:12:29,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:29,491 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-08 00:12:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:12:29,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1804764482, now seen corresponding path program 1 times [2025-02-08 00:12:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48245951] [2025-02-08 00:12:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:29,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:12:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:12:29,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:29,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:29,619 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-08 00:12:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48245951] [2025-02-08 00:12:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48245951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323611015] [2025-02-08 00:12:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:29,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:29,623 INFO L87 Difference]: Start difference. First operand 245 states and 334 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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-08 00:12:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:29,770 INFO L93 Difference]: Finished difference Result 482 states and 654 transitions. [2025-02-08 00:12:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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-08 00:12:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:29,772 INFO L225 Difference]: With dead ends: 482 [2025-02-08 00:12:29,772 INFO L226 Difference]: Without dead ends: 283 [2025-02-08 00:12:29,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:29,773 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 359 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 435 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-08 00:12:29,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-08 00:12:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 235. [2025-02-08 00:12:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.358974358974359) internal successors, (318), 234 states have internal predecessors, (318), 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-08 00:12:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 318 transitions. [2025-02-08 00:12:29,780 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 318 transitions. Word has length 51 [2025-02-08 00:12:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:29,780 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 318 transitions. [2025-02-08 00:12:29,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 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-08 00:12:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 318 transitions. [2025-02-08 00:12:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 00:12:29,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:29,781 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-08 00:12:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:12:29,781 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:29,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1607823946, now seen corresponding path program 1 times [2025-02-08 00:12:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548035433] [2025-02-08 00:12:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:29,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:12:29,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:12:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:29,889 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-08 00:12:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548035433] [2025-02-08 00:12:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548035433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966394587] [2025-02-08 00:12:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:29,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:12:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:12:29,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:12:29,891 INFO L87 Difference]: Start difference. First operand 235 states and 318 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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-08 00:12:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:30,006 INFO L93 Difference]: Finished difference Result 436 states and 590 transitions. [2025-02-08 00:12:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:12:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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-08 00:12:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:30,008 INFO L225 Difference]: With dead ends: 436 [2025-02-08 00:12:30,008 INFO L226 Difference]: Without dead ends: 236 [2025-02-08 00:12:30,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 00:12:30,009 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 289 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 435 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-08 00:12:30,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 435 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:12:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-08 00:12:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2025-02-08 00:12:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 210 states have internal predecessors, (288), 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-08 00:12:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2025-02-08 00:12:30,015 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 52 [2025-02-08 00:12:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:30,015 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2025-02-08 00:12:30,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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-08 00:12:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2025-02-08 00:12:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 00:12:30,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:30,016 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] [2025-02-08 00:12:30,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:12:30,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1409138360, now seen corresponding path program 1 times [2025-02-08 00:12:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096885082] [2025-02-08 00:12:30,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 00:12:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 00:12:30,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:30,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:31,891 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-08 00:12:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096885082] [2025-02-08 00:12:31,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096885082] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104576851] [2025-02-08 00:12:31,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:31,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:31,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:31,896 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-08 00:12:31,898 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-08 00:12:32,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 00:12:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 00:12:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:32,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 00:12:32,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:33,082 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-08 00:12:33,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:34,092 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-08 00:12:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104576851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:34,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-02-08 00:12:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554665044] [2025-02-08 00:12:34,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 00:12:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:34,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 00:12:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:12:34,095 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 36 states, 36 states have (on average 7.138888888888889) internal successors, (257), 35 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:35,763 INFO L93 Difference]: Finished difference Result 601 states and 820 transitions. [2025-02-08 00:12:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-08 00:12:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.138888888888889) internal successors, (257), 35 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-08 00:12:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:35,766 INFO L225 Difference]: With dead ends: 601 [2025-02-08 00:12:35,766 INFO L226 Difference]: Without dead ends: 439 [2025-02-08 00:12:35,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=996, Invalid=4260, Unknown=0, NotChecked=0, Total=5256 [2025-02-08 00:12:35,774 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1787 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:35,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 2417 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:12:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-08 00:12:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 338. [2025-02-08 00:12:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.367952522255193) internal successors, (461), 337 states have internal predecessors, (461), 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-08 00:12:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 461 transitions. [2025-02-08 00:12:35,784 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 461 transitions. Word has length 98 [2025-02-08 00:12:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:35,784 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 461 transitions. [2025-02-08 00:12:35,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.138888888888889) internal successors, (257), 35 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2025-02-08 00:12:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 00:12:35,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:35,786 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] [2025-02-08 00:12:35,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:12:35,990 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-08 00:12:35,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1424572469, now seen corresponding path program 1 times [2025-02-08 00:12:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328653220] [2025-02-08 00:12:35,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:36,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 00:12:36,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 00:12:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:36,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:37,646 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-08 00:12:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328653220] [2025-02-08 00:12:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328653220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530325577] [2025-02-08 00:12:37,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:37,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:37,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:37,650 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-08 00:12:37,652 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-08 00:12:37,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 00:12:38,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 00:12:38,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:38,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 171 conjuncts are in the unsatisfiable core [2025-02-08 00:12:38,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:39,651 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-08 00:12:39,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530325577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:41,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:41,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 24] total 53 [2025-02-08 00:12:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810908181] [2025-02-08 00:12:41,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:41,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-08 00:12:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:41,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-08 00:12:41,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2628, Unknown=0, NotChecked=0, Total=2862 [2025-02-08 00:12:41,770 INFO L87 Difference]: Start difference. First operand 338 states and 461 transitions. Second operand has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 53 states have internal predecessors, (278), 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-08 00:12:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:47,847 INFO L93 Difference]: Finished difference Result 945 states and 1295 transitions. [2025-02-08 00:12:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-02-08 00:12:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 53 states have internal predecessors, (278), 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-08 00:12:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:47,850 INFO L225 Difference]: With dead ends: 945 [2025-02-08 00:12:47,850 INFO L226 Difference]: Without dead ends: 715 [2025-02-08 00:12:47,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6604 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1653, Invalid=20103, Unknown=0, NotChecked=0, Total=21756 [2025-02-08 00:12:47,857 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1731 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 3889 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:47,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2799 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3889 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 00:12:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-02-08 00:12:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 570. [2025-02-08 00:12:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.3778558875219684) internal successors, (784), 569 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 784 transitions. [2025-02-08 00:12:47,872 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 784 transitions. Word has length 99 [2025-02-08 00:12:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:47,872 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 784 transitions. [2025-02-08 00:12:47,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 53 states have internal predecessors, (278), 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-08 00:12:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 784 transitions. [2025-02-08 00:12:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 00:12:47,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:47,876 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] [2025-02-08 00:12:47,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:12:48,080 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-08 00:12:48,080 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:48,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1397374686, now seen corresponding path program 1 times [2025-02-08 00:12:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:48,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887045325] [2025-02-08 00:12:48,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:48,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:48,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 00:12:48,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 00:12:48,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:48,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:49,438 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-08 00:12:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887045325] [2025-02-08 00:12:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887045325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:12:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207600055] [2025-02-08 00:12:49,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:12:49,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:49,441 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-08 00:12:49,443 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-08 00:12:49,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 00:12:49,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 00:12:49,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:49,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:49,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-02-08 00:12:49,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:12:51,114 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-08 00:12:51,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:12:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207600055] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:12:53,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:12:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 23] total 54 [2025-02-08 00:12:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884899870] [2025-02-08 00:12:53,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:12:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 00:12:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 00:12:53,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2709, Unknown=0, NotChecked=0, Total=2970 [2025-02-08 00:12:53,158 INFO L87 Difference]: Start difference. First operand 570 states and 784 transitions. Second operand has 55 states, 55 states have (on average 5.218181818181818) internal successors, (287), 54 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-08 00:12:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:58,066 INFO L93 Difference]: Finished difference Result 1262 states and 1733 transitions. [2025-02-08 00:12:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-02-08 00:12:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.218181818181818) internal successors, (287), 54 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 100 [2025-02-08 00:12:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:58,070 INFO L225 Difference]: With dead ends: 1262 [2025-02-08 00:12:58,070 INFO L226 Difference]: Without dead ends: 821 [2025-02-08 00:12:58,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1554, Invalid=14196, Unknown=0, NotChecked=0, Total=15750 [2025-02-08 00:12:58,075 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 2371 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:58,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 2395 Invalid, 3461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3413 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 00:12:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-08 00:12:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 560. [2025-02-08 00:12:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3738819320214668) internal successors, (768), 559 states have internal predecessors, (768), 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-08 00:12:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2025-02-08 00:12:58,091 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 100 [2025-02-08 00:12:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:58,092 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2025-02-08 00:12:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.218181818181818) internal successors, (287), 54 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-08 00:12:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2025-02-08 00:12:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 00:12:58,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:58,096 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] [2025-02-08 00:12:58,107 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-08 00:12:58,297 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-08 00:12:58,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:58,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1638170399, now seen corresponding path program 1 times [2025-02-08 00:12:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599430224] [2025-02-08 00:12:58,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:58,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 00:12:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 00:12:58,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:58,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:00,165 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-08 00:13:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599430224] [2025-02-08 00:13:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599430224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428417805] [2025-02-08 00:13:00,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:00,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:00,167 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-08 00:13:00,168 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-08 00:13:00,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 00:13:00,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 00:13:00,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:00,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:00,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-02-08 00:13:00,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:01,753 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-08 00:13:01,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:03,443 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-08 00:13:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428417805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:03,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:13:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 24] total 58 [2025-02-08 00:13:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318211496] [2025-02-08 00:13:03,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-08 00:13:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:03,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-08 00:13:03,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3090, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 00:13:03,446 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 59 states, 59 states have (on average 4.6440677966101696) internal successors, (274), 58 states have internal predecessors, (274), 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-08 00:13:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:08,484 INFO L93 Difference]: Finished difference Result 1669 states and 2278 transitions. [2025-02-08 00:13:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-02-08 00:13:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.6440677966101696) internal successors, (274), 58 states have internal predecessors, (274), 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-08 00:13:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:08,489 INFO L225 Difference]: With dead ends: 1669 [2025-02-08 00:13:08,489 INFO L226 Difference]: Without dead ends: 1225 [2025-02-08 00:13:08,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1747, Invalid=16885, Unknown=0, NotChecked=0, Total=18632 [2025-02-08 00:13:08,493 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2214 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:08,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 3998 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 00:13:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-02-08 00:13:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 927. [2025-02-08 00:13:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.347732181425486) internal successors, (1248), 926 states have internal predecessors, (1248), 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-08 00:13:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1248 transitions. [2025-02-08 00:13:08,515 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1248 transitions. Word has length 101 [2025-02-08 00:13:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:08,515 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1248 transitions. [2025-02-08 00:13:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.6440677966101696) internal successors, (274), 58 states have internal predecessors, (274), 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-08 00:13:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1248 transitions. [2025-02-08 00:13:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 00:13:08,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:08,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:13:08,530 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-08 00:13:08,719 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-08 00:13:08,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -945132403, now seen corresponding path program 1 times [2025-02-08 00:13:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486651525] [2025-02-08 00:13:08,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:08,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:08,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 00:13:08,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 00:13:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:09,477 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-08 00:13:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486651525] [2025-02-08 00:13:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486651525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514718132] [2025-02-08 00:13:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:09,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:09,481 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-08 00:13:09,483 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-08 00:13:09,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 00:13:09,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 00:13:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:09,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:09,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 00:13:09,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:10,311 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-08 00:13:10,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514718132] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:11,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:13:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 18] total 38 [2025-02-08 00:13:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191338752] [2025-02-08 00:13:11,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 00:13:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:11,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 00:13:11,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 00:13:11,515 INFO L87 Difference]: Start difference. First operand 927 states and 1248 transitions. Second operand has 39 states, 39 states have (on average 7.102564102564102) internal successors, (277), 38 states have internal predecessors, (277), 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-08 00:13:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:14,078 INFO L93 Difference]: Finished difference Result 3022 states and 4058 transitions. [2025-02-08 00:13:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-08 00:13:14,079 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.102564102564102) internal successors, (277), 38 states have internal predecessors, (277), 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-08 00:13:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:14,086 INFO L225 Difference]: With dead ends: 3022 [2025-02-08 00:13:14,086 INFO L226 Difference]: Without dead ends: 2314 [2025-02-08 00:13:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=740, Invalid=5112, Unknown=0, NotChecked=0, Total=5852 [2025-02-08 00:13:14,089 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1054 mSDsluCounter, 5076 mSDsCounter, 0 mSdLazyCounter, 4209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 5309 SdHoareTripleChecker+Invalid, 4226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 5309 Invalid, 4226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4209 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 00:13:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-02-08 00:13:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1444. [2025-02-08 00:13:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.3437283437283438) internal successors, (1939), 1443 states have internal predecessors, (1939), 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-08 00:13:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1939 transitions. [2025-02-08 00:13:14,121 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1939 transitions. Word has length 102 [2025-02-08 00:13:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:14,121 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1939 transitions. [2025-02-08 00:13:14,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.102564102564102) internal successors, (277), 38 states have internal predecessors, (277), 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-08 00:13:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1939 transitions. [2025-02-08 00:13:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 00:13:14,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:14,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:13:14,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 00:13:14,324 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-08 00:13:14,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1995590103, now seen corresponding path program 1 times [2025-02-08 00:13:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662970343] [2025-02-08 00:13:14,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 00:13:14,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 00:13:14,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:16,768 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-08 00:13:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662970343] [2025-02-08 00:13:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662970343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67288929] [2025-02-08 00:13:16,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:16,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:16,772 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-08 00:13:16,774 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-08 00:13:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 00:13:17,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 00:13:17,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:17,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:17,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-02-08 00:13:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:18,025 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-08 00:13:18,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67288929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:19,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:13:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 23] total 49 [2025-02-08 00:13:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889408162] [2025-02-08 00:13:19,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:19,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-08 00:13:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:19,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-08 00:13:19,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 00:13:19,989 INFO L87 Difference]: Start difference. First operand 1444 states and 1939 transitions. Second operand has 50 states, 50 states have (on average 5.6) internal successors, (280), 49 states have internal predecessors, (280), 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-08 00:13:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:22,881 INFO L93 Difference]: Finished difference Result 2623 states and 3549 transitions. [2025-02-08 00:13:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-08 00:13:22,881 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.6) internal successors, (280), 49 states have internal predecessors, (280), 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 103 [2025-02-08 00:13:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:22,886 INFO L225 Difference]: With dead ends: 2623 [2025-02-08 00:13:22,886 INFO L226 Difference]: Without dead ends: 1493 [2025-02-08 00:13:22,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=869, Invalid=6271, Unknown=0, NotChecked=0, Total=7140 [2025-02-08 00:13:22,890 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1380 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:22,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 2695 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 00:13:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-02-08 00:13:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1321. [2025-02-08 00:13:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3522727272727273) internal successors, (1785), 1320 states have internal predecessors, (1785), 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-08 00:13:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1785 transitions. [2025-02-08 00:13:22,919 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1785 transitions. Word has length 103 [2025-02-08 00:13:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:22,921 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1785 transitions. [2025-02-08 00:13:22,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.6) internal successors, (280), 49 states have internal predecessors, (280), 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-08 00:13:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1785 transitions. [2025-02-08 00:13:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 00:13:22,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:22,924 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] [2025-02-08 00:13:22,935 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-08 00:13:23,125 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-08 00:13:23,125 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:23,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1748252886, now seen corresponding path program 2 times [2025-02-08 00:13:23,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268591198] [2025-02-08 00:13:23,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:13:23,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:23,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-02-08 00:13:24,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 00:13:24,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:13:24,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268591198] [2025-02-08 00:13:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268591198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324320394] [2025-02-08 00:13:26,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:13:26,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:26,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:26,680 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-08 00:13:26,681 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-08 00:13:26,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-02-08 00:13:27,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 00:13:27,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:13:27,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:27,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 256 conjuncts are in the unsatisfiable core [2025-02-08 00:13:27,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 18 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:30,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324320394] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:34,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:13:34,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 44, 32] total 92 [2025-02-08 00:13:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907827953] [2025-02-08 00:13:34,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:34,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-02-08 00:13:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:34,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-02-08 00:13:34,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=7972, Unknown=0, NotChecked=0, Total=8556 [2025-02-08 00:13:34,632 INFO L87 Difference]: Start difference. First operand 1321 states and 1785 transitions. Second operand has 93 states, 93 states have (on average 4.67741935483871) internal successors, (435), 92 states have internal predecessors, (435), 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)