./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.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 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:20:32,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:20:32,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:20:32,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:20:32,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:20:32,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:20:32,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:20:32,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:20:32,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:20:32,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:20:32,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:20:32,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:20:32,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:20:32,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:20:32,292 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:20:32,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:20:32,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:20:32,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:20:32,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:20:32,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:20:32,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:20:32,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:20:32,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:32,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:32,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:20:32,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:32,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:32,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:32,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:32,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:20:32,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:20:32,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:20:32,298 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 -> 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd [2025-01-09 08:20:32,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:20:32,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:20:32,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:20:32,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:20:32,588 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:20:32,589 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_arrays_palu.c [2025-01-09 08:20:33,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407f9f743/b5a1ae217e3c4822b168be564b647126/FLAG205160aab [2025-01-09 08:20:34,298 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:20:34,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c [2025-01-09 08:20:34,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407f9f743/b5a1ae217e3c4822b168be564b647126/FLAG205160aab [2025-01-09 08:20:34,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/407f9f743/b5a1ae217e3c4822b168be564b647126 [2025-01-09 08:20:34,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:20:34,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:20:34,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:34,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:20:34,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:20:34,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:34,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3606ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34, skipping insertion in model container [2025-01-09 08:20:34,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:34,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:20:34,665 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_arrays_palu.c[1255,1268] [2025-01-09 08:20:34,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:34,816 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:20:34,824 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_arrays_palu.c[1255,1268] [2025-01-09 08:20:34,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:34,936 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:20:34,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34 WrapperNode [2025-01-09 08:20:34,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:34,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:34,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:20:34,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:20:34,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:34,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,109 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1243 [2025-01-09 08:20:35,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:35,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:20:35,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:20:35,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:20:35,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,238 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:20:35,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:35,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:35,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:35,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:35,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (1/1) ... [2025-01-09 08:20:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:35,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:20:35,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:20:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:20:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:35,662 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:35,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:20:37,280 INFO L? ?]: Removed 682 outVars from TransFormulas that were not future-live. [2025-01-09 08:20:37,280 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:20:37,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:20:37,305 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:20:37,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:37 BoogieIcfgContainer [2025-01-09 08:20:37,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:20:37,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:20:37,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:20:37,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:20:37,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:20:34" (1/3) ... [2025-01-09 08:20:37,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc802aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:37, skipping insertion in model container [2025-01-09 08:20:37,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:34" (2/3) ... [2025-01-09 08:20:37,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc802aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:37, skipping insertion in model container [2025-01-09 08:20:37,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:37" (3/3) ... [2025-01-09 08:20:37,318 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_palu.c [2025-01-09 08:20:37,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:20:37,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_palu.c that has 1 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:20:37,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:20:37,405 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;@3d160be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:20:37,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:20:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.4972222222222222) internal successors, (539), 361 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 08:20:37,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:37,418 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-01-09 08:20:37,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 596137605, now seen corresponding path program 1 times [2025-01-09 08:20:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096003325] [2025-01-09 08:20:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:37,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 08:20:37,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 08:20:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096003325] [2025-01-09 08:20:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096003325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848748352] [2025-01-09 08:20:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:38,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:38,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:38,568 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.4972222222222222) internal successors, (539), 361 states have internal predecessors, (539), 0 states have call successors, (0), 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 12.75) 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-01-09 08:20:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:38,675 INFO L93 Difference]: Finished difference Result 681 states and 1017 transitions. [2025-01-09 08:20:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) 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-01-09 08:20:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:38,688 INFO L225 Difference]: With dead ends: 681 [2025-01-09 08:20:38,688 INFO L226 Difference]: Without dead ends: 361 [2025-01-09 08:20:38,692 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-01-09 08:20:38,698 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:38,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1593 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-09 08:20:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-01-09 08:20:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.4916666666666667) internal successors, (537), 360 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 537 transitions. [2025-01-09 08:20:38,771 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 537 transitions. Word has length 51 [2025-01-09 08:20:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 537 transitions. [2025-01-09 08:20:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) 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-01-09 08:20:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 537 transitions. [2025-01-09 08:20:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 08:20:38,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:38,777 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-01-09 08:20:38,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:20:38,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:38,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1302092023, now seen corresponding path program 1 times [2025-01-09 08:20:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078193719] [2025-01-09 08:20:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 08:20:38,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 08:20:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078193719] [2025-01-09 08:20:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078193719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821490080] [2025-01-09 08:20:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:39,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:39,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:39,173 INFO L87 Difference]: Start difference. First operand 361 states and 537 transitions. Second operand has 4 states, 4 states have (on average 13.0) 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-01-09 08:20:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:39,233 INFO L93 Difference]: Finished difference Result 682 states and 1015 transitions. [2025-01-09 08:20:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) 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-01-09 08:20:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:39,237 INFO L225 Difference]: With dead ends: 682 [2025-01-09 08:20:39,238 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 08:20:39,241 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-01-09 08:20:39,242 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:39,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1589 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 08:20:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-01-09 08:20:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.488950276243094) internal successors, (539), 362 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 539 transitions. [2025-01-09 08:20:39,265 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 539 transitions. Word has length 52 [2025-01-09 08:20:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:39,266 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 539 transitions. [2025-01-09 08:20:39,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) 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-01-09 08:20:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 539 transitions. [2025-01-09 08:20:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 08:20:39,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:39,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:20:39,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 612181406, now seen corresponding path program 1 times [2025-01-09 08:20:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607772124] [2025-01-09 08:20:39,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:39,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 08:20:39,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 08:20:39,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:39,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607772124] [2025-01-09 08:20:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607772124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230832189] [2025-01-09 08:20:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:39,831 INFO L87 Difference]: Start difference. First operand 363 states and 539 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:39,869 INFO L93 Difference]: Finished difference Result 686 states and 1019 transitions. [2025-01-09 08:20:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 08:20:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:39,872 INFO L225 Difference]: With dead ends: 686 [2025-01-09 08:20:39,872 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 08:20:39,873 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-01-09 08:20:39,874 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:39,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1589 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 08:20:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 08:20:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4862637362637363) internal successors, (541), 364 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 541 transitions. [2025-01-09 08:20:39,889 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 541 transitions. Word has length 53 [2025-01-09 08:20:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:39,890 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 541 transitions. [2025-01-09 08:20:39,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 541 transitions. [2025-01-09 08:20:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 08:20:39,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:39,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:20:39,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1588325794, now seen corresponding path program 1 times [2025-01-09 08:20:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83461375] [2025-01-09 08:20:39,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:39,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 08:20:39,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 08:20:39,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:39,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83461375] [2025-01-09 08:20:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83461375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:40,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828244072] [2025-01-09 08:20:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:40,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:40,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:40,199 INFO L87 Difference]: Start difference. First operand 365 states and 541 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:40,262 INFO L93 Difference]: Finished difference Result 718 states and 1065 transitions. [2025-01-09 08:20:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 08:20:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:40,265 INFO L225 Difference]: With dead ends: 718 [2025-01-09 08:20:40,265 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 08:20:40,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:40,266 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 28 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:40,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2116 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 08:20:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-01-09 08:20:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.484771573604061) internal successors, (585), 394 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 585 transitions. [2025-01-09 08:20:40,285 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 585 transitions. Word has length 54 [2025-01-09 08:20:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:40,290 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 585 transitions. [2025-01-09 08:20:40,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 585 transitions. [2025-01-09 08:20:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 08:20:40,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:40,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:40,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:20:40,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:40,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:40,292 INFO L85 PathProgramCache]: Analyzing trace with hash 111431526, now seen corresponding path program 1 times [2025-01-09 08:20:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360726861] [2025-01-09 08:20:40,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:40,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 08:20:40,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 08:20:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:40,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:40,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360726861] [2025-01-09 08:20:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360726861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:40,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:40,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235448045] [2025-01-09 08:20:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:40,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:40,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:40,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:40,988 INFO L87 Difference]: Start difference. First operand 395 states and 585 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:41,114 INFO L93 Difference]: Finished difference Result 758 states and 1123 transitions. [2025-01-09 08:20:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 08:20:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:41,117 INFO L225 Difference]: With dead ends: 758 [2025-01-09 08:20:41,118 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 08:20:41,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:41,119 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 501 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:41,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2614 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 08:20:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2025-01-09 08:20:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4825) internal successors, (593), 400 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 593 transitions. [2025-01-09 08:20:41,131 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 593 transitions. Word has length 55 [2025-01-09 08:20:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 593 transitions. [2025-01-09 08:20:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 593 transitions. [2025-01-09 08:20:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 08:20:41,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:41,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:20:41,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 273603503, now seen corresponding path program 1 times [2025-01-09 08:20:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969496000] [2025-01-09 08:20:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:41,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 08:20:41,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 08:20:41,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:41,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969496000] [2025-01-09 08:20:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969496000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517694798] [2025-01-09 08:20:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:41,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:41,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:41,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:41,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:41,651 INFO L87 Difference]: Start difference. First operand 401 states and 593 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:41,785 INFO L93 Difference]: Finished difference Result 782 states and 1158 transitions. [2025-01-09 08:20:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 08:20:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:41,788 INFO L225 Difference]: With dead ends: 782 [2025-01-09 08:20:41,789 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 08:20:41,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:41,790 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 515 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:41,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 3140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 08:20:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2025-01-09 08:20:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4760765550239234) internal successors, (617), 418 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 617 transitions. [2025-01-09 08:20:41,801 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 617 transitions. Word has length 56 [2025-01-09 08:20:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:41,801 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 617 transitions. [2025-01-09 08:20:41,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 617 transitions. [2025-01-09 08:20:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 08:20:41,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:41,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:20:41,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 4551560, now seen corresponding path program 1 times [2025-01-09 08:20:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770895579] [2025-01-09 08:20:41,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:41,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 08:20:41,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 08:20:41,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:41,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770895579] [2025-01-09 08:20:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770895579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:42,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432248256] [2025-01-09 08:20:42,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:42,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:42,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:42,346 INFO L87 Difference]: Start difference. First operand 419 states and 617 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:42,666 INFO L93 Difference]: Finished difference Result 810 states and 1191 transitions. [2025-01-09 08:20:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 08:20:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:42,670 INFO L225 Difference]: With dead ends: 810 [2025-01-09 08:20:42,670 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 08:20:42,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:20:42,675 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 495 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:42,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2385 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 08:20:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2025-01-09 08:20:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4760765550239234) internal successors, (617), 418 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 617 transitions. [2025-01-09 08:20:42,694 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 617 transitions. Word has length 56 [2025-01-09 08:20:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:42,695 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 617 transitions. [2025-01-09 08:20:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 617 transitions. [2025-01-09 08:20:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 08:20:42,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:42,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:20:42,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:42,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1213928041, now seen corresponding path program 1 times [2025-01-09 08:20:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431021634] [2025-01-09 08:20:42,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:42,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 08:20:42,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 08:20:42,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:42,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:43,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:43,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431021634] [2025-01-09 08:20:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431021634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:43,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260502169] [2025-01-09 08:20:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:43,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:43,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:43,471 INFO L87 Difference]: Start difference. First operand 419 states and 617 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:43,589 INFO L93 Difference]: Finished difference Result 804 states and 1184 transitions. [2025-01-09 08:20:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 08:20:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:43,593 INFO L225 Difference]: With dead ends: 804 [2025-01-09 08:20:43,593 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 08:20:43,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:43,595 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 528 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:43,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 08:20:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 426. [2025-01-09 08:20:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.4752941176470589) internal successors, (627), 425 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 627 transitions. [2025-01-09 08:20:43,614 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 627 transitions. Word has length 57 [2025-01-09 08:20:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 627 transitions. [2025-01-09 08:20:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 627 transitions. [2025-01-09 08:20:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 08:20:43,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:43,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:20:43,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1195833884, now seen corresponding path program 1 times [2025-01-09 08:20:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737826179] [2025-01-09 08:20:43,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:43,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 08:20:43,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 08:20:43,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:43,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737826179] [2025-01-09 08:20:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737826179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065060985] [2025-01-09 08:20:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:44,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:44,265 INFO L87 Difference]: Start difference. First operand 426 states and 627 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:44,370 INFO L93 Difference]: Finished difference Result 964 states and 1413 transitions. [2025-01-09 08:20:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 08:20:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:44,374 INFO L225 Difference]: With dead ends: 964 [2025-01-09 08:20:44,374 INFO L226 Difference]: Without dead ends: 580 [2025-01-09 08:20:44,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:44,375 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 793 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1560 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-09 08:20:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 497. [2025-01-09 08:20:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.469758064516129) internal successors, (729), 496 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 729 transitions. [2025-01-09 08:20:44,389 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 729 transitions. Word has length 58 [2025-01-09 08:20:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:44,389 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 729 transitions. [2025-01-09 08:20:44,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 729 transitions. [2025-01-09 08:20:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 08:20:44,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:44,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:44,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:20:44,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2071929649, now seen corresponding path program 1 times [2025-01-09 08:20:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440618618] [2025-01-09 08:20:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:44,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 08:20:44,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 08:20:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440618618] [2025-01-09 08:20:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440618618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147372452] [2025-01-09 08:20:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:44,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:44,906 INFO L87 Difference]: Start difference. First operand 497 states and 729 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:45,000 INFO L93 Difference]: Finished difference Result 908 states and 1332 transitions. [2025-01-09 08:20:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 08:20:45,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:45,003 INFO L225 Difference]: With dead ends: 908 [2025-01-09 08:20:45,003 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 08:20:45,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:45,004 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 523 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:45,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2116 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 08:20:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-09 08:20:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.4676113360323886) internal successors, (725), 494 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 725 transitions. [2025-01-09 08:20:45,016 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 725 transitions. Word has length 58 [2025-01-09 08:20:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:45,017 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 725 transitions. [2025-01-09 08:20:45,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 725 transitions. [2025-01-09 08:20:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 08:20:45,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:45,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:45,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:20:45,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:45,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1833886746, now seen corresponding path program 1 times [2025-01-09 08:20:45,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:45,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367315729] [2025-01-09 08:20:45,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:45,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 08:20:45,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 08:20:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367315729] [2025-01-09 08:20:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367315729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712048010] [2025-01-09 08:20:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:45,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:45,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:45,316 INFO L87 Difference]: Start difference. First operand 495 states and 725 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:45,613 INFO L93 Difference]: Finished difference Result 1171 states and 1719 transitions. [2025-01-09 08:20:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 08:20:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:45,617 INFO L225 Difference]: With dead ends: 1171 [2025-01-09 08:20:45,617 INFO L226 Difference]: Without dead ends: 726 [2025-01-09 08:20:45,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:45,618 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1379 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:45,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 1943 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-01-09 08:20:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 460. [2025-01-09 08:20:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.4662309368191722) internal successors, (673), 459 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 673 transitions. [2025-01-09 08:20:45,633 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 673 transitions. Word has length 58 [2025-01-09 08:20:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:45,633 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 673 transitions. [2025-01-09 08:20:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 673 transitions. [2025-01-09 08:20:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 08:20:45,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:45,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:45,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:20:45,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:45,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 321816023, now seen corresponding path program 1 times [2025-01-09 08:20:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25895390] [2025-01-09 08:20:45,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:45,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 08:20:46,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 08:20:46,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:46,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25895390] [2025-01-09 08:20:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25895390] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:46,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687248622] [2025-01-09 08:20:46,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:46,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:46,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:20:47,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 08:20:47,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 08:20:47,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:47,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:47,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 08:20:47,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:47,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687248622] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:48,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 08:20:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138226230] [2025-01-09 08:20:48,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:48,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:20:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:48,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:20:48,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:48,274 INFO L87 Difference]: Start difference. First operand 460 states and 673 transitions. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:48,697 INFO L93 Difference]: Finished difference Result 1125 states and 1646 transitions. [2025-01-09 08:20:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-01-09 08:20:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:48,701 INFO L225 Difference]: With dead ends: 1125 [2025-01-09 08:20:48,701 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 08:20:48,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:20:48,703 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 2116 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:48,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 1950 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:20:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 08:20:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2025-01-09 08:20:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.4535864978902953) internal successors, (689), 474 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 689 transitions. [2025-01-09 08:20:48,715 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 689 transitions. Word has length 217 [2025-01-09 08:20:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:48,715 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 689 transitions. [2025-01-09 08:20:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 689 transitions. [2025-01-09 08:20:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 08:20:48,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:48,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:48,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:20:48,927 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,SelfDestructingSolverStorable11 [2025-01-09 08:20:48,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1759421432, now seen corresponding path program 1 times [2025-01-09 08:20:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498587993] [2025-01-09 08:20:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 08:20:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 08:20:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498587993] [2025-01-09 08:20:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498587993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:49,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39758795] [2025-01-09 08:20:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:49,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:49,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:49,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:49,973 INFO L87 Difference]: Start difference. First operand 475 states and 689 transitions. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:50,315 INFO L93 Difference]: Finished difference Result 1156 states and 1689 transitions. [2025-01-09 08:20:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-01-09 08:20:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:50,319 INFO L225 Difference]: With dead ends: 1156 [2025-01-09 08:20:50,319 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 08:20:50,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:50,321 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1528 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:50,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1427 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:20:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 08:20:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 727. [2025-01-09 08:20:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.4683195592286502) internal successors, (1066), 726 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1066 transitions. [2025-01-09 08:20:50,338 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1066 transitions. Word has length 218 [2025-01-09 08:20:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:50,339 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1066 transitions. [2025-01-09 08:20:50,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1066 transitions. [2025-01-09 08:20:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 08:20:50,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:50,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:20:50,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1060257666, now seen corresponding path program 1 times [2025-01-09 08:20:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564422655] [2025-01-09 08:20:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:50,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 08:20:50,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 08:20:50,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:50,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564422655] [2025-01-09 08:20:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564422655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24623474] [2025-01-09 08:20:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:51,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:51,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:51,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:51,310 INFO L87 Difference]: Start difference. First operand 727 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:51,715 INFO L93 Difference]: Finished difference Result 1360 states and 2003 transitions. [2025-01-09 08:20:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:51,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-01-09 08:20:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:51,720 INFO L225 Difference]: With dead ends: 1360 [2025-01-09 08:20:51,720 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 08:20:51,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:51,722 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 599 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:51,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1125 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:20:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 08:20:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-01-09 08:20:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.4669421487603307) internal successors, (1065), 726 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1065 transitions. [2025-01-09 08:20:51,741 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1065 transitions. Word has length 219 [2025-01-09 08:20:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1065 transitions. [2025-01-09 08:20:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1065 transitions. [2025-01-09 08:20:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 08:20:51,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:51,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:51,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:20:51,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:51,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1786280910, now seen corresponding path program 1 times [2025-01-09 08:20:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:51,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928225029] [2025-01-09 08:20:51,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 08:20:52,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 08:20:52,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:52,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928225029] [2025-01-09 08:20:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928225029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:52,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:52,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240806811] [2025-01-09 08:20:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:52,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:52,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:52,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:52,810 INFO L87 Difference]: Start difference. First operand 727 states and 1065 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:53,317 INFO L93 Difference]: Finished difference Result 1112 states and 1631 transitions. [2025-01-09 08:20:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-01-09 08:20:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:53,321 INFO L225 Difference]: With dead ends: 1112 [2025-01-09 08:20:53,321 INFO L226 Difference]: Without dead ends: 729 [2025-01-09 08:20:53,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:53,322 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1223 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:53,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1124 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:20:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-09 08:20:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 728. [2025-01-09 08:20:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4662998624484183) internal successors, (1066), 727 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1066 transitions. [2025-01-09 08:20:53,341 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1066 transitions. Word has length 220 [2025-01-09 08:20:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:53,342 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1066 transitions. [2025-01-09 08:20:53,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1066 transitions. [2025-01-09 08:20:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 08:20:53,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:53,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:53,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:20:53,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:53,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1803128783, now seen corresponding path program 1 times [2025-01-09 08:20:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297511364] [2025-01-09 08:20:53,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 08:20:53,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 08:20:53,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:53,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297511364] [2025-01-09 08:20:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297511364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:54,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:54,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955507912] [2025-01-09 08:20:54,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:54,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:54,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:54,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:54,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:54,459 INFO L87 Difference]: Start difference. First operand 728 states and 1066 transitions. Second operand has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:55,415 INFO L93 Difference]: Finished difference Result 1481 states and 2173 transitions. [2025-01-09 08:20:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:55,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2025-01-09 08:20:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:55,423 INFO L225 Difference]: With dead ends: 1481 [2025-01-09 08:20:55,423 INFO L226 Difference]: Without dead ends: 1098 [2025-01-09 08:20:55,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:55,425 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 814 mSDsluCounter, 2685 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:55,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 3396 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 08:20:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-01-09 08:20:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 732. [2025-01-09 08:20:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4637482900136798) internal successors, (1070), 731 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1070 transitions. [2025-01-09 08:20:55,448 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1070 transitions. Word has length 221 [2025-01-09 08:20:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1070 transitions. [2025-01-09 08:20:55,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1070 transitions. [2025-01-09 08:20:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 08:20:55,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:55,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:20:55,452 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -570264786, now seen corresponding path program 1 times [2025-01-09 08:20:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969746682] [2025-01-09 08:20:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:55,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 08:20:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 08:20:55,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:55,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969746682] [2025-01-09 08:20:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969746682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:56,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:56,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:56,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495481328] [2025-01-09 08:20:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:56,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:56,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:56,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:56,602 INFO L87 Difference]: Start difference. First operand 732 states and 1070 transitions. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:57,594 INFO L93 Difference]: Finished difference Result 1489 states and 2181 transitions. [2025-01-09 08:20:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-01-09 08:20:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:57,599 INFO L225 Difference]: With dead ends: 1489 [2025-01-09 08:20:57,600 INFO L226 Difference]: Without dead ends: 1102 [2025-01-09 08:20:57,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:57,602 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 809 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 3401 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:57,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 3401 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 08:20:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-01-09 08:20:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 732. [2025-01-09 08:20:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4637482900136798) internal successors, (1070), 731 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1070 transitions. [2025-01-09 08:20:57,625 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1070 transitions. Word has length 222 [2025-01-09 08:20:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:57,626 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1070 transitions. [2025-01-09 08:20:57,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1070 transitions. [2025-01-09 08:20:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 08:20:57,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:57,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:20:57,630 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1842957116, now seen corresponding path program 1 times [2025-01-09 08:20:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82185739] [2025-01-09 08:20:57,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:57,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 08:20:58,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 08:20:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 08:20:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82185739] [2025-01-09 08:20:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82185739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40291058] [2025-01-09 08:20:59,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:59,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:59,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:20:59,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 08:20:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 08:20:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:59,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 08:20:59,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:00,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40291058] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:01,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 8] total 19 [2025-01-09 08:21:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431639187] [2025-01-09 08:21:01,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 08:21:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 08:21:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:21:01,712 INFO L87 Difference]: Start difference. First operand 732 states and 1070 transitions. Second operand has 19 states, 19 states have (on average 29.68421052631579) internal successors, (564), 19 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:02,976 INFO L93 Difference]: Finished difference Result 1495 states and 2198 transitions. [2025-01-09 08:21:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:21:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 29.68421052631579) internal successors, (564), 19 states have internal predecessors, (564), 0 states have call successors, (0), 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 222 [2025-01-09 08:21:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:02,982 INFO L225 Difference]: With dead ends: 1495 [2025-01-09 08:21:02,982 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 08:21:02,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2025-01-09 08:21:02,984 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1700 mSDsluCounter, 3657 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:02,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 4025 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 08:21:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 08:21:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 732. [2025-01-09 08:21:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4637482900136798) internal successors, (1070), 731 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1070 transitions. [2025-01-09 08:21:03,007 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1070 transitions. Word has length 222 [2025-01-09 08:21:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:03,007 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1070 transitions. [2025-01-09 08:21:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 29.68421052631579) internal successors, (564), 19 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1070 transitions. [2025-01-09 08:21:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 08:21:03,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:03,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:03,024 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-01-09 08:21:03,211 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,SelfDestructingSolverStorable17 [2025-01-09 08:21:03,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash 323286701, now seen corresponding path program 1 times [2025-01-09 08:21:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587776896] [2025-01-09 08:21:03,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 08:21:03,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 08:21:03,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:03,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587776896] [2025-01-09 08:21:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587776896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152881002] [2025-01-09 08:21:03,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:03,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:03,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:03,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:21:03,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:21:04,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 08:21:04,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 08:21:04,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:04,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 08:21:04,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:05,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:05,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152881002] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:05,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:05,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-09 08:21:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077292543] [2025-01-09 08:21:05,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:05,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 08:21:05,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:05,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 08:21:05,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:21:05,901 INFO L87 Difference]: Start difference. First operand 732 states and 1070 transitions. Second operand has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:06,922 INFO L93 Difference]: Finished difference Result 1485 states and 2163 transitions. [2025-01-09 08:21:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:21:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 0 states have call successors, (0), 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 223 [2025-01-09 08:21:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:06,927 INFO L225 Difference]: With dead ends: 1485 [2025-01-09 08:21:06,927 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 08:21:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2025-01-09 08:21:06,929 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 4944 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4944 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4944 Valid, 3364 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 08:21:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 08:21:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 746. [2025-01-09 08:21:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.457718120805369) internal successors, (1086), 745 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1086 transitions. [2025-01-09 08:21:06,946 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1086 transitions. Word has length 223 [2025-01-09 08:21:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:06,946 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1086 transitions. [2025-01-09 08:21:06,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1086 transitions. [2025-01-09 08:21:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-09 08:21:06,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:06,952 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:06,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:21:07,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:07,153 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:07,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1493491252, now seen corresponding path program 1 times [2025-01-09 08:21:07,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:07,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665508738] [2025-01-09 08:21:07,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:07,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-09 08:21:08,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-09 08:21:08,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665508738] [2025-01-09 08:21:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665508738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538556674] [2025-01-09 08:21:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:08,891 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-01-09 08:21:08,893 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-01-09 08:21:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-09 08:21:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-09 08:21:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:09,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:09,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 2480 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 08:21:09,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:10,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538556674] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:11,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-09 08:21:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875820948] [2025-01-09 08:21:11,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 08:21:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:11,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 08:21:11,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:21:11,330 INFO L87 Difference]: Start difference. First operand 746 states and 1086 transitions. Second operand has 15 states, 15 states have (on average 40.13333333333333) internal successors, (602), 15 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:11,994 INFO L93 Difference]: Finished difference Result 1187 states and 1727 transitions. [2025-01-09 08:21:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:21:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 40.13333333333333) internal successors, (602), 15 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2025-01-09 08:21:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:11,998 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 08:21:11,998 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 08:21:11,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-01-09 08:21:12,000 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 3252 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3252 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:12,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3252 Valid, 3777 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:21:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 08:21:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 798. [2025-01-09 08:21:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.4504391468005018) internal successors, (1156), 797 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1156 transitions. [2025-01-09 08:21:12,016 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1156 transitions. Word has length 384 [2025-01-09 08:21:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:12,017 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1156 transitions. [2025-01-09 08:21:12,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 40.13333333333333) internal successors, (602), 15 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1156 transitions. [2025-01-09 08:21:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 08:21:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:12,022 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:12,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 08:21:12,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:12,223 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:12,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 585240963, now seen corresponding path program 1 times [2025-01-09 08:21:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944735527] [2025-01-09 08:21:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:12,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 08:21:12,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 08:21:12,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:12,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 185 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944735527] [2025-01-09 08:21:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944735527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511310745] [2025-01-09 08:21:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:13,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:13,977 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-01-09 08:21:13,979 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-01-09 08:21:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 08:21:15,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 08:21:15,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:15,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:15,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 08:21:15,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:15,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:21:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511310745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:21:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-01-09 08:21:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812130577] [2025-01-09 08:21:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:15,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:15,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:21:15,931 INFO L87 Difference]: Start difference. First operand 798 states and 1156 transitions. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:16,391 INFO L93 Difference]: Finished difference Result 1545 states and 2247 transitions. [2025-01-09 08:21:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:16,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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 385 [2025-01-09 08:21:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:16,396 INFO L225 Difference]: With dead ends: 1545 [2025-01-09 08:21:16,397 INFO L226 Difference]: Without dead ends: 1158 [2025-01-09 08:21:16,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:21:16,399 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 964 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:16,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1519 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:21:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-01-09 08:21:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2025-01-09 08:21:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.451082251082251) internal successors, (1676), 1155 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1676 transitions. [2025-01-09 08:21:16,420 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1676 transitions. Word has length 385 [2025-01-09 08:21:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1676 transitions. [2025-01-09 08:21:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1676 transitions. [2025-01-09 08:21:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 08:21:16,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:16,428 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:16,446 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-01-09 08:21:16,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:16,629 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:16,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1311956855, now seen corresponding path program 1 times [2025-01-09 08:21:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571313899] [2025-01-09 08:21:16,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:16,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 08:21:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 08:21:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 187 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571313899] [2025-01-09 08:21:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571313899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26721712] [2025-01-09 08:21:18,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:18,135 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-01-09 08:21:18,137 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-01-09 08:21:18,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 08:21:19,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 08:21:19,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:19,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 08:21:19,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 187 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:19,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 186 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26721712] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:20,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 15 [2025-01-09 08:21:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986631477] [2025-01-09 08:21:20,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:20,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 08:21:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:20,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 08:21:20,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:21:20,612 INFO L87 Difference]: Start difference. First operand 1156 states and 1676 transitions. Second operand has 15 states, 15 states have (on average 40.46666666666667) internal successors, (607), 15 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:21,580 INFO L93 Difference]: Finished difference Result 1851 states and 2697 transitions. [2025-01-09 08:21:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:21:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 40.46666666666667) internal successors, (607), 15 states have internal predecessors, (607), 0 states have call successors, (0), 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 385 [2025-01-09 08:21:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:21,584 INFO L225 Difference]: With dead ends: 1851 [2025-01-09 08:21:21,584 INFO L226 Difference]: Without dead ends: 1160 [2025-01-09 08:21:21,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:21:21,587 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1724 mSDsluCounter, 3698 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:21,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 4069 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:21:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-01-09 08:21:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1158. [2025-01-09 08:21:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4503025064822819) internal successors, (1678), 1157 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1678 transitions. [2025-01-09 08:21:21,604 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1678 transitions. Word has length 385 [2025-01-09 08:21:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1678 transitions. [2025-01-09 08:21:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 40.46666666666667) internal successors, (607), 15 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1678 transitions. [2025-01-09 08:21:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-01-09 08:21:21,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:21,608 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:21,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 08:21:21,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 08:21:21,809 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1519051669, now seen corresponding path program 1 times [2025-01-09 08:21:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255313347] [2025-01-09 08:21:21,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:21,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-09 08:21:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-09 08:21:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 81 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:24,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255313347] [2025-01-09 08:21:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255313347] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464845775] [2025-01-09 08:21:24,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:24,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:24,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:24,100 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-01-09 08:21:24,101 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-01-09 08:21:24,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-09 08:21:25,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-09 08:21:25,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:25,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:25,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 08:21:25,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 184 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 08:21:26,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 08:21:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464845775] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:26,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2025-01-09 08:21:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927268531] [2025-01-09 08:21:26,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 08:21:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 08:21:26,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-01-09 08:21:26,544 INFO L87 Difference]: Start difference. First operand 1158 states and 1678 transitions. Second operand has 23 states, 23 states have (on average 41.65217391304348) internal successors, (958), 23 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:28,882 INFO L93 Difference]: Finished difference Result 3459 states and 5025 transitions. [2025-01-09 08:21:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 08:21:28,883 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 41.65217391304348) internal successors, (958), 23 states have internal predecessors, (958), 0 states have call successors, (0), 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 386 [2025-01-09 08:21:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:28,890 INFO L225 Difference]: With dead ends: 3459 [2025-01-09 08:21:28,890 INFO L226 Difference]: Without dead ends: 2404 [2025-01-09 08:21:28,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 08:21:28,893 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 3095 mSDsluCounter, 9095 mSDsCounter, 0 mSdLazyCounter, 4327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3095 SdHoareTripleChecker+Valid, 9871 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:28,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3095 Valid, 9871 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4327 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:21:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-01-09 08:21:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1638. [2025-01-09 08:21:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1637 states have (on average 1.4410507025045816) internal successors, (2359), 1637 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2359 transitions. [2025-01-09 08:21:28,922 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2359 transitions. Word has length 386 [2025-01-09 08:21:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2359 transitions. [2025-01-09 08:21:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 41.65217391304348) internal successors, (958), 23 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2359 transitions. [2025-01-09 08:21:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 08:21:28,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:28,928 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:28,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 08:21:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:29,129 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1862927634, now seen corresponding path program 1 times [2025-01-09 08:21:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835628641] [2025-01-09 08:21:29,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:29,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 08:21:30,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 08:21:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835628641] [2025-01-09 08:21:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835628641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:21:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919081020] [2025-01-09 08:21:31,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:31,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:21:31,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 08:21:31,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 08:21:32,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 08:21:32,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:32,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:32,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 2493 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 08:21:32,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:21:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:32,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:21:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919081020] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:21:33,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:21:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2025-01-09 08:21:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853531800] [2025-01-09 08:21:33,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:21:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 08:21:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:33,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 08:21:33,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:21:33,594 INFO L87 Difference]: Start difference. First operand 1638 states and 2359 transitions. Second operand has 24 states, 24 states have (on average 43.916666666666664) internal successors, (1054), 24 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:36,327 INFO L93 Difference]: Finished difference Result 3977 states and 5708 transitions. [2025-01-09 08:21:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 08:21:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 43.916666666666664) internal successors, (1054), 24 states have internal predecessors, (1054), 0 states have call successors, (0), 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 389 [2025-01-09 08:21:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:36,333 INFO L225 Difference]: With dead ends: 3977 [2025-01-09 08:21:36,333 INFO L226 Difference]: Without dead ends: 2871 [2025-01-09 08:21:36,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=2290, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 08:21:36,336 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 2546 mSDsluCounter, 15126 mSDsCounter, 0 mSdLazyCounter, 5736 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 5739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:36,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2546 Valid, 16513 Invalid, 5739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5736 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 08:21:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2025-01-09 08:21:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1626. [2025-01-09 08:21:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.4443076923076923) internal successors, (2347), 1625 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2347 transitions. [2025-01-09 08:21:36,360 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2347 transitions. Word has length 389 [2025-01-09 08:21:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2347 transitions. [2025-01-09 08:21:36,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 43.916666666666664) internal successors, (1054), 24 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2347 transitions. [2025-01-09 08:21:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 08:21:36,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:36,366 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:36,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 08:21:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:36,567 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash -420484277, now seen corresponding path program 1 times [2025-01-09 08:21:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857981305] [2025-01-09 08:21:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:36,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.