./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/eca-rers2012/Problem13_label43.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35560e922bf8333807d0348ddb335d0f345175bbe017d76c2c9d638827ad9537 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:54:45,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:54:45,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:54:45,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:54:45,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:54:45,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:54:45,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:54:45,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:54:45,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:54:45,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:54:45,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:54:45,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:54:45,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:54:45,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:54:45,227 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:54:45,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:54:45,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:45,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:54:45,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:45,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:54:45,229 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35560e922bf8333807d0348ddb335d0f345175bbe017d76c2c9d638827ad9537 [2025-01-08 23:54:45,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:54:45,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:54:45,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:54:45,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:54:45,455 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:54:45,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label43.c [2025-01-08 23:54:46,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b46119fc1/d0b25a7eab924a96a4ca5c87ccb558ad/FLAG44af75282 [2025-01-08 23:54:47,234 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:54:47,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label43.c [2025-01-08 23:54:47,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b46119fc1/d0b25a7eab924a96a4ca5c87ccb558ad/FLAG44af75282 [2025-01-08 23:54:47,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b46119fc1/d0b25a7eab924a96a4ca5c87ccb558ad [2025-01-08 23:54:47,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:54:47,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:54:47,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:47,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:54:47,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:54:47,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:47" (1/1) ... [2025-01-08 23:54:47,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:47, skipping insertion in model container [2025-01-08 23:54:47,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:47" (1/1) ... [2025-01-08 23:54:47,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:54:47,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label43.c[2870,2883] [2025-01-08 23:54:48,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:48,551 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:54:48,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label43.c[2870,2883] [2025-01-08 23:54:48,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:48,881 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:54:48,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48 WrapperNode [2025-01-08 23:54:48,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:48,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:48,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:54:48,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:54:48,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:48,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,416 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:54:49,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:49,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:54:49,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:54:49,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:54:49,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,784 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-08 23:54:49,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:49,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:50,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:50,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:54:50,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:54:50,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:54:50,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:54:50,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (1/1) ... [2025-01-08 23:54:50,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:50,070 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-08 23:54:50,079 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-08 23:54:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:54:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:54:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:54:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:54:50,158 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:54:50,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:54:54,379 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:54:54,379 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:54:54,414 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:54:54,416 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:54:54,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:54 BoogieIcfgContainer [2025-01-08 23:54:54,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:54:54,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:54:54,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:54:54,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:54:54,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:54:47" (1/3) ... [2025-01-08 23:54:54,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731daa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:54, skipping insertion in model container [2025-01-08 23:54:54,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:48" (2/3) ... [2025-01-08 23:54:54,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731daa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:54, skipping insertion in model container [2025-01-08 23:54:54,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:54" (3/3) ... [2025-01-08 23:54:54,424 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label43.c [2025-01-08 23:54:54,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:54:54,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label43.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:54:54,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:54:54,493 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;@83f9b69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:54:54,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:54:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 23:54:54,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:54,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:54,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:54,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 341754170, now seen corresponding path program 1 times [2025-01-08 23:54:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036385837] [2025-01-08 23:54:54,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:54,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 23:54:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 23:54:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:54,654 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-08 23:54:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036385837] [2025-01-08 23:54:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036385837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:54,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435834722] [2025-01-08 23:54:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:54,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:54,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:54,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:54,672 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-08 23:54:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:57,792 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-01-08 23:54:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-01-08 23:54:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:57,809 INFO L225 Difference]: With dead ends: 3147 [2025-01-08 23:54:57,809 INFO L226 Difference]: Without dead ends: 1964 [2025-01-08 23:54:57,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:57,816 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 1161 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:57,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 989 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:54:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-01-08 23:54:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-01-08 23:54:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 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-08 23:54:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-01-08 23:54:57,898 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 18 [2025-01-08 23:54:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-01-08 23:54:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-08 23:54:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-01-08 23:54:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-08 23:54:57,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:57,901 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:54:57,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:54:57,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1819481874, now seen corresponding path program 1 times [2025-01-08 23:54:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016268108] [2025-01-08 23:54:57,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:57,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-08 23:54:57,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-08 23:54:57,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:57,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:58,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016268108] [2025-01-08 23:54:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016268108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:58,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706752259] [2025-01-08 23:54:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:58,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:58,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:58,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:58,121 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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-08 23:55:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:01,700 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2025-01-08 23:55:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:01,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-08 23:55:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:01,713 INFO L225 Difference]: With dead ends: 5542 [2025-01-08 23:55:01,713 INFO L226 Difference]: Without dead ends: 3593 [2025-01-08 23:55:01,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:01,716 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:01,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:55:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2025-01-08 23:55:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2025-01-08 23:55:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 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-08 23:55:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-01-08 23:55:01,772 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 89 [2025-01-08 23:55:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-01-08 23:55:01,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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-08 23:55:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-01-08 23:55:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-08 23:55:01,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:01,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:01,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:55:01,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:01,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -128409077, now seen corresponding path program 1 times [2025-01-08 23:55:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:01,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240111670] [2025-01-08 23:55:01,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:01,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-08 23:55:01,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-08 23:55:01,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:02,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240111670] [2025-01-08 23:55:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240111670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370312574] [2025-01-08 23:55:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:02,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:02,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:02,007 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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-08 23:55:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:05,018 INFO L93 Difference]: Finished difference Result 10400 states and 15683 transitions. [2025-01-08 23:55:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-08 23:55:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:05,045 INFO L225 Difference]: With dead ends: 10400 [2025-01-08 23:55:05,045 INFO L226 Difference]: Without dead ends: 6821 [2025-01-08 23:55:05,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:05,052 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 928 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:05,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 600 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:55:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2025-01-08 23:55:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6809. [2025-01-08 23:55:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6809 states, 6808 states have (on average 1.4344888366627497) internal successors, (9766), 6808 states have internal predecessors, (9766), 0 states have call successors, (0), 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-08 23:55:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 9766 transitions. [2025-01-08 23:55:05,158 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 9766 transitions. Word has length 103 [2025-01-08 23:55:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:05,159 INFO L471 AbstractCegarLoop]: Abstraction has 6809 states and 9766 transitions. [2025-01-08 23:55:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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-08 23:55:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 9766 transitions. [2025-01-08 23:55:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 23:55:05,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:05,163 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:55:05,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:55:05,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -346591261, now seen corresponding path program 1 times [2025-01-08 23:55:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193271803] [2025-01-08 23:55:05,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:05,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 23:55:05,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 23:55:05,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:05,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193271803] [2025-01-08 23:55:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193271803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683908355] [2025-01-08 23:55:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:05,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:05,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:05,408 INFO L87 Difference]: Start difference. First operand 6809 states and 9766 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 23:55:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:08,689 INFO L93 Difference]: Finished difference Result 20096 states and 28906 transitions. [2025-01-08 23:55:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-08 23:55:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:08,720 INFO L225 Difference]: With dead ends: 20096 [2025-01-08 23:55:08,721 INFO L226 Difference]: Without dead ends: 13289 [2025-01-08 23:55:08,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:08,727 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 834 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:08,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1044 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:55:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13289 states. [2025-01-08 23:55:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13289 to 13169. [2025-01-08 23:55:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13169 states, 13168 states have (on average 1.3734811664641555) internal successors, (18086), 13168 states have internal predecessors, (18086), 0 states have call successors, (0), 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-08 23:55:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13169 states to 13169 states and 18086 transitions. [2025-01-08 23:55:08,909 INFO L78 Accepts]: Start accepts. Automaton has 13169 states and 18086 transitions. Word has length 119 [2025-01-08 23:55:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:08,909 INFO L471 AbstractCegarLoop]: Abstraction has 13169 states and 18086 transitions. [2025-01-08 23:55:08,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 23:55:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 13169 states and 18086 transitions. [2025-01-08 23:55:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-08 23:55:08,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:08,910 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:55:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:55:08,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1489622114, now seen corresponding path program 1 times [2025-01-08 23:55:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794259708] [2025-01-08 23:55:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:08,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-08 23:55:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-08 23:55:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794259708] [2025-01-08 23:55:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794259708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648439522] [2025-01-08 23:55:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:09,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:09,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:09,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:09,107 INFO L87 Difference]: Start difference. First operand 13169 states and 18086 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-08 23:55:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:12,645 INFO L93 Difference]: Finished difference Result 38182 states and 52644 transitions. [2025-01-08 23:55:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-01-08 23:55:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:12,699 INFO L225 Difference]: With dead ends: 38182 [2025-01-08 23:55:12,699 INFO L226 Difference]: Without dead ends: 25015 [2025-01-08 23:55:12,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:12,714 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 770 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:12,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1135 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:55:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25015 states. [2025-01-08 23:55:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25015 to 24981. [2025-01-08 23:55:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24980 states have (on average 1.244595676541233) internal successors, (31090), 24980 states have internal predecessors, (31090), 0 states have call successors, (0), 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-08 23:55:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 31090 transitions. [2025-01-08 23:55:13,170 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 31090 transitions. Word has length 121 [2025-01-08 23:55:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:13,170 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 31090 transitions. [2025-01-08 23:55:13,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-08 23:55:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 31090 transitions. [2025-01-08 23:55:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-08 23:55:13,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:13,173 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:13,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:55:13,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:13,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1754958473, now seen corresponding path program 1 times [2025-01-08 23:55:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342898401] [2025-01-08 23:55:13,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:13,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-08 23:55:13,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-08 23:55:13,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:13,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 23:55:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342898401] [2025-01-08 23:55:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342898401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004968664] [2025-01-08 23:55:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:13,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:13,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:13,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:13,591 INFO L87 Difference]: Start difference. First operand 24981 states and 31090 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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-08 23:55:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:16,305 INFO L93 Difference]: Finished difference Result 49173 states and 61371 transitions. [2025-01-08 23:55:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 210 [2025-01-08 23:55:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:16,340 INFO L225 Difference]: With dead ends: 49173 [2025-01-08 23:55:16,341 INFO L226 Difference]: Without dead ends: 24981 [2025-01-08 23:55:16,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:16,360 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:16,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:55:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24981 states. [2025-01-08 23:55:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24981 to 24981. [2025-01-08 23:55:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24980 states have (on average 1.244195356285028) internal successors, (31080), 24980 states have internal predecessors, (31080), 0 states have call successors, (0), 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-08 23:55:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 31080 transitions. [2025-01-08 23:55:16,643 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 31080 transitions. Word has length 210 [2025-01-08 23:55:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:16,643 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 31080 transitions. [2025-01-08 23:55:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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-08 23:55:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 31080 transitions. [2025-01-08 23:55:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 23:55:16,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:16,648 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:16,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:55:16,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:16,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash 188621277, now seen corresponding path program 1 times [2025-01-08 23:55:16,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:16,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122633655] [2025-01-08 23:55:16,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:16,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:16,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 23:55:16,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 23:55:16,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122633655] [2025-01-08 23:55:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122633655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115605069] [2025-01-08 23:55:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:16,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:16,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:16,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:16,783 INFO L87 Difference]: Start difference. First operand 24981 states and 31080 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:19,971 INFO L93 Difference]: Finished difference Result 60998 states and 77839 transitions. [2025-01-08 23:55:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-01-08 23:55:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:20,026 INFO L225 Difference]: With dead ends: 60998 [2025-01-08 23:55:20,027 INFO L226 Difference]: Without dead ends: 36806 [2025-01-08 23:55:20,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:20,044 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 843 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:20,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1044 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:55:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36806 states. [2025-01-08 23:55:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36806 to 36794. [2025-01-08 23:55:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36794 states, 36793 states have (on average 1.2249884488897345) internal successors, (45071), 36793 states have internal predecessors, (45071), 0 states have call successors, (0), 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-08 23:55:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36794 states to 36794 states and 45071 transitions. [2025-01-08 23:55:20,439 INFO L78 Accepts]: Start accepts. Automaton has 36794 states and 45071 transitions. Word has length 217 [2025-01-08 23:55:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:20,439 INFO L471 AbstractCegarLoop]: Abstraction has 36794 states and 45071 transitions. [2025-01-08 23:55:20,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36794 states and 45071 transitions. [2025-01-08 23:55:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 23:55:20,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:20,441 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:55:20,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:55:20,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1047993787, now seen corresponding path program 1 times [2025-01-08 23:55:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962803629] [2025-01-08 23:55:20,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:20,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 23:55:20,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 23:55:20,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:20,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962803629] [2025-01-08 23:55:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962803629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:20,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025913206] [2025-01-08 23:55:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:20,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:20,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:20,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:20,549 INFO L87 Difference]: Start difference. First operand 36794 states and 45071 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-08 23:55:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:23,973 INFO L93 Difference]: Finished difference Result 72615 states and 89088 transitions. [2025-01-08 23:55:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-01-08 23:55:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:24,014 INFO L225 Difference]: With dead ends: 72615 [2025-01-08 23:55:24,014 INFO L226 Difference]: Without dead ends: 36610 [2025-01-08 23:55:24,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:24,027 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1038 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:24,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1656 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:55:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36610 states. [2025-01-08 23:55:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36610 to 36604. [2025-01-08 23:55:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36604 states, 36603 states have (on average 1.1544682129880064) internal successors, (42257), 36603 states have internal predecessors, (42257), 0 states have call successors, (0), 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-08 23:55:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36604 states to 36604 states and 42257 transitions. [2025-01-08 23:55:24,338 INFO L78 Accepts]: Start accepts. Automaton has 36604 states and 42257 transitions. Word has length 232 [2025-01-08 23:55:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:24,339 INFO L471 AbstractCegarLoop]: Abstraction has 36604 states and 42257 transitions. [2025-01-08 23:55:24,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-08 23:55:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36604 states and 42257 transitions. [2025-01-08 23:55:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-08 23:55:24,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:24,342 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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-08 23:55:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:55:24,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:24,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -314420557, now seen corresponding path program 1 times [2025-01-08 23:55:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105954406] [2025-01-08 23:55:24,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:24,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 23:55:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 23:55:24,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:55:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105954406] [2025-01-08 23:55:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105954406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679695202] [2025-01-08 23:55:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:24,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:24,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:24,502 INFO L87 Difference]: Start difference. First operand 36604 states and 42257 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 23:55:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:27,973 INFO L93 Difference]: Finished difference Result 102316 states and 118890 transitions. [2025-01-08 23:55:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 248 [2025-01-08 23:55:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:28,034 INFO L225 Difference]: With dead ends: 102316 [2025-01-08 23:55:28,034 INFO L226 Difference]: Without dead ends: 66501 [2025-01-08 23:55:28,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:28,052 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 844 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 979 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:55:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66501 states. [2025-01-08 23:55:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66501 to 61771. [2025-01-08 23:55:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61771 states, 61770 states have (on average 1.121321029626032) internal successors, (69264), 61770 states have internal predecessors, (69264), 0 states have call successors, (0), 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-08 23:55:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61771 states to 61771 states and 69264 transitions. [2025-01-08 23:55:28,568 INFO L78 Accepts]: Start accepts. Automaton has 61771 states and 69264 transitions. Word has length 248 [2025-01-08 23:55:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:28,569 INFO L471 AbstractCegarLoop]: Abstraction has 61771 states and 69264 transitions. [2025-01-08 23:55:28,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 23:55:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 61771 states and 69264 transitions. [2025-01-08 23:55:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-08 23:55:28,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:28,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:55:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:55:28,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1266266086, now seen corresponding path program 1 times [2025-01-08 23:55:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344908156] [2025-01-08 23:55:28,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-08 23:55:28,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-08 23:55:28,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:28,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 23:55:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344908156] [2025-01-08 23:55:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344908156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388326459] [2025-01-08 23:55:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:28,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:28,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:28,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:28,922 INFO L87 Difference]: Start difference. First operand 61771 states and 69264 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:35,786 INFO L93 Difference]: Finished difference Result 174903 states and 196685 transitions. [2025-01-08 23:55:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:35,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2025-01-08 23:55:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:35,914 INFO L225 Difference]: With dead ends: 174903 [2025-01-08 23:55:35,915 INFO L226 Difference]: Without dead ends: 113921 [2025-01-08 23:55:35,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:35,944 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1715 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 5996 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 7097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 5996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:35,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 760 Invalid, 7097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 5996 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-08 23:55:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113921 states. [2025-01-08 23:55:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113921 to 111436. [2025-01-08 23:55:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111436 states, 111435 states have (on average 1.1149638802889577) internal successors, (124246), 111435 states have internal predecessors, (124246), 0 states have call successors, (0), 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-08 23:55:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111436 states to 111436 states and 124246 transitions. [2025-01-08 23:55:37,149 INFO L78 Accepts]: Start accepts. Automaton has 111436 states and 124246 transitions. Word has length 301 [2025-01-08 23:55:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:37,149 INFO L471 AbstractCegarLoop]: Abstraction has 111436 states and 124246 transitions. [2025-01-08 23:55:37,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111436 states and 124246 transitions. [2025-01-08 23:55:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-08 23:55:37,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:37,152 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:37,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:55:37,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:37,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash -534381425, now seen corresponding path program 1 times [2025-01-08 23:55:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:37,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657661586] [2025-01-08 23:55:37,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:37,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 23:55:37,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 23:55:37,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:37,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 308 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 23:55:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657661586] [2025-01-08 23:55:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657661586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753281202] [2025-01-08 23:55:38,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:38,190 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-08 23:55:38,192 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-08 23:55:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 23:55:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 23:55:38,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:38,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:55:38,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-01-08 23:55:38,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753281202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:38,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:38,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:55:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910939661] [2025-01-08 23:55:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:38,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:38,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:38,400 INFO L87 Difference]: Start difference. First operand 111436 states and 124246 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-08 23:55:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:41,373 INFO L93 Difference]: Finished difference Result 223636 states and 249929 transitions. [2025-01-08 23:55:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 344 [2025-01-08 23:55:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:41,516 INFO L225 Difference]: With dead ends: 223636 [2025-01-08 23:55:41,516 INFO L226 Difference]: Without dead ends: 126378 [2025-01-08 23:55:41,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:41,565 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 896 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:41,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1850 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:55:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126378 states. [2025-01-08 23:55:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126378 to 117713. [2025-01-08 23:55:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117713 states, 117712 states have (on average 1.1111271578088895) internal successors, (130793), 117712 states have internal predecessors, (130793), 0 states have call successors, (0), 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-08 23:55:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117713 states to 117713 states and 130793 transitions. [2025-01-08 23:55:43,102 INFO L78 Accepts]: Start accepts. Automaton has 117713 states and 130793 transitions. Word has length 344 [2025-01-08 23:55:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 117713 states and 130793 transitions. [2025-01-08 23:55:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-08 23:55:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 117713 states and 130793 transitions. [2025-01-08 23:55:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-08 23:55:43,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:43,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 23:55:43,120 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-08 23:55:43,306 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,SelfDestructingSolverStorable10 [2025-01-08 23:55:43,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 683998629, now seen corresponding path program 1 times [2025-01-08 23:55:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522581078] [2025-01-08 23:55:43,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-08 23:55:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-08 23:55:43,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:43,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-08 23:55:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522581078] [2025-01-08 23:55:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522581078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032289677] [2025-01-08 23:55:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:43,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:43,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:43,627 INFO L87 Difference]: Start difference. First operand 117713 states and 130793 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-08 23:55:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:47,534 INFO L93 Difference]: Finished difference Result 268662 states and 301088 transitions. [2025-01-08 23:55:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 347 [2025-01-08 23:55:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:47,738 INFO L225 Difference]: With dead ends: 268662 [2025-01-08 23:55:47,739 INFO L226 Difference]: Without dead ends: 165127 [2025-01-08 23:55:47,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:47,817 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1011 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:47,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 636 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:55:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165127 states. [2025-01-08 23:55:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165127 to 139808. [2025-01-08 23:55:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139808 states, 139807 states have (on average 1.1165535345154391) internal successors, (156102), 139807 states have internal predecessors, (156102), 0 states have call successors, (0), 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-08 23:55:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139808 states to 139808 states and 156102 transitions. [2025-01-08 23:55:49,843 INFO L78 Accepts]: Start accepts. Automaton has 139808 states and 156102 transitions. Word has length 347 [2025-01-08 23:55:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 139808 states and 156102 transitions. [2025-01-08 23:55:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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-08 23:55:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 139808 states and 156102 transitions. [2025-01-08 23:55:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-08 23:55:49,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:49,852 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:55:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:55:49,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1238352476, now seen corresponding path program 1 times [2025-01-08 23:55:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073895063] [2025-01-08 23:55:49,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:50,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-08 23:55:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-08 23:55:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 464 proven. 25 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-08 23:55:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073895063] [2025-01-08 23:55:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073895063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443942447] [2025-01-08 23:55:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:50,834 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-08 23:55:50,835 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-08 23:55:50,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-08 23:55:50,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-08 23:55:50,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:50,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:50,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:55:50,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-08 23:55:51,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443942447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:55:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721311248] [2025-01-08 23:55:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:51,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:51,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:51,290 INFO L87 Difference]: Start difference. First operand 139808 states and 156102 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:55,066 INFO L93 Difference]: Finished difference Result 317378 states and 357901 transitions. [2025-01-08 23:55:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2025-01-08 23:55:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:55,486 INFO L225 Difference]: With dead ends: 317378 [2025-01-08 23:55:55,486 INFO L226 Difference]: Without dead ends: 183086 [2025-01-08 23:55:55,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:55,551 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 739 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:55,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1101 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:55:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183086 states. [2025-01-08 23:55:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183086 to 127962. [2025-01-08 23:55:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127962 states, 127961 states have (on average 1.1046490727643579) internal successors, (141352), 127961 states have internal predecessors, (141352), 0 states have call successors, (0), 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-08 23:55:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127962 states to 127962 states and 141352 transitions. [2025-01-08 23:55:57,052 INFO L78 Accepts]: Start accepts. Automaton has 127962 states and 141352 transitions. Word has length 414 [2025-01-08 23:55:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 127962 states and 141352 transitions. [2025-01-08 23:55:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 127962 states and 141352 transitions. [2025-01-08 23:55:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-01-08 23:55:57,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:57,057 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:57,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:55:57,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:57,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:57,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1117413889, now seen corresponding path program 1 times [2025-01-08 23:55:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651494802] [2025-01-08 23:55:57,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:57,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-08 23:55:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-08 23:55:57,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:55:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651494802] [2025-01-08 23:55:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651494802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561547127] [2025-01-08 23:55:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:57,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:57,436 INFO L87 Difference]: Start difference. First operand 127962 states and 141352 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-08 23:56:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:00,673 INFO L93 Difference]: Finished difference Result 258292 states and 285087 transitions. [2025-01-08 23:56:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 417 [2025-01-08 23:56:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:00,823 INFO L225 Difference]: With dead ends: 258292 [2025-01-08 23:56:00,823 INFO L226 Difference]: Without dead ends: 130330 [2025-01-08 23:56:00,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:00,880 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 894 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:00,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1429 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:56:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130330 states. [2025-01-08 23:56:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130330 to 127954. [2025-01-08 23:56:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127954 states, 127953 states have (on average 1.083100826084578) internal successors, (138586), 127953 states have internal predecessors, (138586), 0 states have call successors, (0), 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-08 23:56:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127954 states to 127954 states and 138586 transitions. [2025-01-08 23:56:02,392 INFO L78 Accepts]: Start accepts. Automaton has 127954 states and 138586 transitions. Word has length 417 [2025-01-08 23:56:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 127954 states and 138586 transitions. [2025-01-08 23:56:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-08 23:56:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 127954 states and 138586 transitions. [2025-01-08 23:56:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-08 23:56:02,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:02,399 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:56:02,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:56:02,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1204278219, now seen corresponding path program 1 times [2025-01-08 23:56:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357230450] [2025-01-08 23:56:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:02,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-08 23:56:02,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-08 23:56:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:56:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357230450] [2025-01-08 23:56:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357230450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:02,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776469156] [2025-01-08 23:56:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:02,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:02,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:02,587 INFO L87 Difference]: Start difference. First operand 127954 states and 138586 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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-08 23:56:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:05,768 INFO L93 Difference]: Finished difference Result 294491 states and 319678 transitions. [2025-01-08 23:56:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 478 [2025-01-08 23:56:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:05,955 INFO L225 Difference]: With dead ends: 294491 [2025-01-08 23:56:05,955 INFO L226 Difference]: Without dead ends: 164959 [2025-01-08 23:56:06,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:06,013 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 710 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:06,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1864 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:56:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164959 states. [2025-01-08 23:56:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164959 to 164152. [2025-01-08 23:56:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164152 states, 164151 states have (on average 1.0710382513661203) internal successors, (175812), 164151 states have internal predecessors, (175812), 0 states have call successors, (0), 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-08 23:56:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164152 states to 164152 states and 175812 transitions. [2025-01-08 23:56:07,950 INFO L78 Accepts]: Start accepts. Automaton has 164152 states and 175812 transitions. Word has length 478 [2025-01-08 23:56:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 164152 states and 175812 transitions. [2025-01-08 23:56:07,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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-08 23:56:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 164152 states and 175812 transitions. [2025-01-08 23:56:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-08 23:56:07,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:07,965 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:56:07,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:56:07,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:07,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1101510930, now seen corresponding path program 1 times [2025-01-08 23:56:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910773584] [2025-01-08 23:56:07,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:08,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-08 23:56:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-08 23:56:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 441 proven. 110 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-08 23:56:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910773584] [2025-01-08 23:56:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910773584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614667827] [2025-01-08 23:56:09,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:09,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:09,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:09,087 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-08 23:56:09,090 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-08 23:56:09,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-08 23:56:09,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-08 23:56:09,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:09,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:09,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:56:09,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-01-08 23:56:09,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614667827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:56:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403697630] [2025-01-08 23:56:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:09,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:56:09,530 INFO L87 Difference]: Start difference. First operand 164152 states and 175812 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:56:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:13,132 INFO L93 Difference]: Finished difference Result 327514 states and 350830 transitions. [2025-01-08 23:56:13,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 489 [2025-01-08 23:56:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:13,355 INFO L225 Difference]: With dead ends: 327514 [2025-01-08 23:56:13,355 INFO L226 Difference]: Without dead ends: 164151 [2025-01-08 23:56:13,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:56:13,440 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 1042 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:13,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1393 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]