./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label34.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/Problem17_label34.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 c371ce1f15a8888766c33a9703b06847f70d6274570c9b062f0d05b5c6caa625 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:13:11,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:13:11,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:13:11,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:13:11,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:13:11,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:13:11,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:13:11,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:13:11,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:13:11,317 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:13:11,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:13:11,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:13:11,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:13:11,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:13:11,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:13:11,319 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:13:11,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:11,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:11,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:13:11,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:13:11,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:13:11,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:13:11,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:13:11,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:13:11,321 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 -> c371ce1f15a8888766c33a9703b06847f70d6274570c9b062f0d05b5c6caa625 [2025-01-09 00:13:11,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:13:11,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:13:11,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:13:11,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:13:11,534 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:13:11,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label34.c [2025-01-09 00:13:12,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af7f4c6b5/9f17153514024065ba89ce423a70af62/FLAG3df2638b9 [2025-01-09 00:13:13,051 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:13:13,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label34.c [2025-01-09 00:13:13,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af7f4c6b5/9f17153514024065ba89ce423a70af62/FLAG3df2638b9 [2025-01-09 00:13:13,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af7f4c6b5/9f17153514024065ba89ce423a70af62 [2025-01-09 00:13:13,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:13:13,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:13:13,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:13,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:13:13,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:13:13,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:13,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab54703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13, skipping insertion in model container [2025-01-09 00:13:13,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:13,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:13:13,359 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/Problem17_label34.c[2983,2996] [2025-01-09 00:13:13,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:13,679 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:13:13,695 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/Problem17_label34.c[2983,2996] [2025-01-09 00:13:13,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:13,901 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:13:13,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13 WrapperNode [2025-01-09 00:13:13,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:13,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:13,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:13:13,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:13:13,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:13,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,116 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:13:14,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:14,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:13:14,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:13:14,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:13:14,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:13:14,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:13:14,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:13:14,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:13:14,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:13:14,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (1/1) ... [2025-01-09 00:13:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:14,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:13:14,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:13:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:13:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:13:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:13:14,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:13:14,553 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:13:14,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:13:16,865 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:13:16,865 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:13:16,887 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:13:16,887 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:13:16,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:16 BoogieIcfgContainer [2025-01-09 00:13:16,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:13:16,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:13:16,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:13:16,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:13:16,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:13:13" (1/3) ... [2025-01-09 00:13:16,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d772d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:16, skipping insertion in model container [2025-01-09 00:13:16,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:13" (2/3) ... [2025-01-09 00:13:16,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3d772d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:16, skipping insertion in model container [2025-01-09 00:13:16,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:16" (3/3) ... [2025-01-09 00:13:16,894 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label34.c [2025-01-09 00:13:16,904 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:13:16,905 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label34.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:13:16,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:13:16,964 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;@73a69b80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:13:16,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:13:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 00:13:16,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:16,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:16,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2004448828, now seen corresponding path program 1 times [2025-01-09 00:13:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311646745] [2025-01-09 00:13:16,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 00:13:17,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 00:13:17,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:17,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311646745] [2025-01-09 00:13:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311646745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:17,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991120923] [2025-01-09 00:13:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:17,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:17,194 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:19,151 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:13:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-01-09 00:13:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:19,163 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:13:19,163 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:13:19,166 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-09 00:13:19,168 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 469 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:19,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:13:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:13:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:13:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:13:19,227 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 19 [2025-01-09 00:13:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:13:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:13:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 00:13:19,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:19,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:19,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:13:19,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash -178311382, now seen corresponding path program 1 times [2025-01-09 00:13:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:19,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942830865] [2025-01-09 00:13:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:19,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 00:13:19,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 00:13:19,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:19,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942830865] [2025-01-09 00:13:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942830865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098987617] [2025-01-09 00:13:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:19,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:19,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:19,487 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:21,319 INFO L93 Difference]: Finished difference Result 2844 states and 4428 transitions. [2025-01-09 00:13:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:21,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 00:13:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:21,327 INFO L225 Difference]: With dead ends: 2844 [2025-01-09 00:13:21,327 INFO L226 Difference]: Without dead ends: 1875 [2025-01-09 00:13:21,329 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-09 00:13:21,330 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 442 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:21,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 242 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-01-09 00:13:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1854. [2025-01-09 00:13:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4889368591473287) internal successors, (2759), 1853 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2759 transitions. [2025-01-09 00:13:21,385 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2759 transitions. Word has length 86 [2025-01-09 00:13:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2759 transitions. [2025-01-09 00:13:21,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2759 transitions. [2025-01-09 00:13:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 00:13:21,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:21,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:21,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:13:21,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:21,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1068692930, now seen corresponding path program 1 times [2025-01-09 00:13:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592820154] [2025-01-09 00:13:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 00:13:21,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 00:13:21,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592820154] [2025-01-09 00:13:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592820154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:21,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942933602] [2025-01-09 00:13:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:21,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:21,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:21,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:21,631 INFO L87 Difference]: Start difference. First operand 1854 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:23,497 INFO L93 Difference]: Finished difference Result 4995 states and 7380 transitions. [2025-01-09 00:13:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 00:13:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:23,506 INFO L225 Difference]: With dead ends: 4995 [2025-01-09 00:13:23,506 INFO L226 Difference]: Without dead ends: 3143 [2025-01-09 00:13:23,508 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-09 00:13:23,509 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 368 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:23,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 558 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-01-09 00:13:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3141. [2025-01-09 00:13:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.3197452229299362) internal successors, (4144), 3140 states have internal predecessors, (4144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4144 transitions. [2025-01-09 00:13:23,546 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4144 transitions. Word has length 94 [2025-01-09 00:13:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4144 transitions. [2025-01-09 00:13:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4144 transitions. [2025-01-09 00:13:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 00:13:23,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:23,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:23,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:13:23,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:23,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2062115570, now seen corresponding path program 1 times [2025-01-09 00:13:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139670485] [2025-01-09 00:13:23,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:23,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 00:13:23,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 00:13:23,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:23,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:13:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139670485] [2025-01-09 00:13:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139670485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:23,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122918875] [2025-01-09 00:13:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:23,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:23,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:23,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:23,701 INFO L87 Difference]: Start difference. First operand 3141 states and 4144 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:25,149 INFO L93 Difference]: Finished difference Result 8416 states and 11323 transitions. [2025-01-09 00:13:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 154 [2025-01-09 00:13:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:25,162 INFO L225 Difference]: With dead ends: 8416 [2025-01-09 00:13:25,163 INFO L226 Difference]: Without dead ends: 5702 [2025-01-09 00:13:25,166 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-09 00:13:25,167 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:25,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-01-09 00:13:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3999. [2025-01-09 00:13:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3998 states have (on average 1.2511255627813906) internal successors, (5002), 3998 states have internal predecessors, (5002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5002 transitions. [2025-01-09 00:13:25,222 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5002 transitions. Word has length 154 [2025-01-09 00:13:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5002 transitions. [2025-01-09 00:13:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5002 transitions. [2025-01-09 00:13:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 00:13:25,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:25,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:25,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:13:25,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:25,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 227994255, now seen corresponding path program 1 times [2025-01-09 00:13:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674381717] [2025-01-09 00:13:25,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:25,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 00:13:25,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 00:13:25,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:25,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674381717] [2025-01-09 00:13:25,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674381717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:25,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:25,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:13:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500879165] [2025-01-09 00:13:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:25,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:13:25,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:25,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:13:25,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:25,530 INFO L87 Difference]: Start difference. First operand 3999 states and 5002 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:27,477 INFO L93 Difference]: Finished difference Result 10144 states and 13051 transitions. [2025-01-09 00:13:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-01-09 00:13:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:27,491 INFO L225 Difference]: With dead ends: 10144 [2025-01-09 00:13:27,492 INFO L226 Difference]: Without dead ends: 6147 [2025-01-09 00:13:27,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:27,497 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 594 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:27,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 915 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:13:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2025-01-09 00:13:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 6134. [2025-01-09 00:13:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.2437632480026088) internal successors, (7628), 6133 states have internal predecessors, (7628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7628 transitions. [2025-01-09 00:13:27,571 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7628 transitions. Word has length 167 [2025-01-09 00:13:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 7628 transitions. [2025-01-09 00:13:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7628 transitions. [2025-01-09 00:13:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 00:13:27,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:27,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:27,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:13:27,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:27,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1041837406, now seen corresponding path program 1 times [2025-01-09 00:13:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624148508] [2025-01-09 00:13:27,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:27,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 00:13:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 00:13:27,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:13:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624148508] [2025-01-09 00:13:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624148508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940044060] [2025-01-09 00:13:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:27,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:27,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:27,701 INFO L87 Difference]: Start difference. First operand 6134 states and 7628 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:29,234 INFO L93 Difference]: Finished difference Result 16089 states and 20189 transitions. [2025-01-09 00:13:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 173 [2025-01-09 00:13:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:29,259 INFO L225 Difference]: With dead ends: 16089 [2025-01-09 00:13:29,259 INFO L226 Difference]: Without dead ends: 9957 [2025-01-09 00:13:29,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:29,265 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 429 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:29,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2025-01-09 00:13:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 8678. [2025-01-09 00:13:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8678 states, 8677 states have (on average 1.202489339633514) internal successors, (10434), 8677 states have internal predecessors, (10434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 10434 transitions. [2025-01-09 00:13:29,366 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 10434 transitions. Word has length 173 [2025-01-09 00:13:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 8678 states and 10434 transitions. [2025-01-09 00:13:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 10434 transitions. [2025-01-09 00:13:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 00:13:29,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:29,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:29,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:13:29,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:29,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1886522927, now seen corresponding path program 1 times [2025-01-09 00:13:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:29,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005994913] [2025-01-09 00:13:29,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:29,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 00:13:29,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 00:13:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005994913] [2025-01-09 00:13:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005994913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:29,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:29,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3927531] [2025-01-09 00:13:29,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:29,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:29,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:29,482 INFO L87 Difference]: Start difference. First operand 8678 states and 10434 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:30,992 INFO L93 Difference]: Finished difference Result 21610 states and 26256 transitions. [2025-01-09 00:13:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 186 [2025-01-09 00:13:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:31,013 INFO L225 Difference]: With dead ends: 21610 [2025-01-09 00:13:31,013 INFO L226 Difference]: Without dead ends: 12934 [2025-01-09 00:13:31,021 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-09 00:13:31,021 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 465 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:31,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 484 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2025-01-09 00:13:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11648. [2025-01-09 00:13:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11648 states, 11647 states have (on average 1.199364643255774) internal successors, (13969), 11647 states have internal predecessors, (13969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11648 states to 11648 states and 13969 transitions. [2025-01-09 00:13:31,128 INFO L78 Accepts]: Start accepts. Automaton has 11648 states and 13969 transitions. Word has length 186 [2025-01-09 00:13:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 11648 states and 13969 transitions. [2025-01-09 00:13:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 11648 states and 13969 transitions. [2025-01-09 00:13:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 00:13:31,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:31,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:31,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:13:31,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2055967890, now seen corresponding path program 1 times [2025-01-09 00:13:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161861609] [2025-01-09 00:13:31,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 00:13:31,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 00:13:31,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161861609] [2025-01-09 00:13:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161861609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2753905] [2025-01-09 00:13:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:31,310 INFO L87 Difference]: Start difference. First operand 11648 states and 13969 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:32,840 INFO L93 Difference]: Finished difference Result 28005 states and 33867 transitions. [2025-01-09 00:13:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-01-09 00:13:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:32,865 INFO L225 Difference]: With dead ends: 28005 [2025-01-09 00:13:32,865 INFO L226 Difference]: Without dead ends: 15507 [2025-01-09 00:13:32,877 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-09 00:13:32,877 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 370 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:32,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 894 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15507 states. [2025-01-09 00:13:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15507 to 15499. [2025-01-09 00:13:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15499 states, 15498 states have (on average 1.1535682023486902) internal successors, (17878), 15498 states have internal predecessors, (17878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15499 states to 15499 states and 17878 transitions. [2025-01-09 00:13:33,010 INFO L78 Accepts]: Start accepts. Automaton has 15499 states and 17878 transitions. Word has length 235 [2025-01-09 00:13:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:33,012 INFO L471 AbstractCegarLoop]: Abstraction has 15499 states and 17878 transitions. [2025-01-09 00:13:33,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15499 states and 17878 transitions. [2025-01-09 00:13:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-09 00:13:33,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:33,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:13:33,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1465259441, now seen corresponding path program 1 times [2025-01-09 00:13:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793477949] [2025-01-09 00:13:33,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:33,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:33,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-09 00:13:33,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 00:13:33,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 172 proven. 70 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793477949] [2025-01-09 00:13:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793477949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053596994] [2025-01-09 00:13:33,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:33,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:33,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:13:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-09 00:13:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 00:13:33,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:33,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:33,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:13:33,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 172 proven. 70 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:33,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053596994] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:13:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:13:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764366396] [2025-01-09 00:13:33,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:33,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:33,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:33,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:33,786 INFO L87 Difference]: Start difference. First operand 15499 states and 17878 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:36,320 INFO L93 Difference]: Finished difference Result 46352 states and 53847 transitions. [2025-01-09 00:13:36,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:36,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2025-01-09 00:13:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:36,358 INFO L225 Difference]: With dead ends: 46352 [2025-01-09 00:13:36,358 INFO L226 Difference]: Without dead ends: 29994 [2025-01-09 00:13:36,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:36,373 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1083 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 1254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1254 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:36,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 147 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1254 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:13:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29994 states. [2025-01-09 00:13:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29994 to 28717. [2025-01-09 00:13:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28717 states, 28716 states have (on average 1.1380763337512187) internal successors, (32681), 28716 states have internal predecessors, (32681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 32681 transitions. [2025-01-09 00:13:36,627 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 32681 transitions. Word has length 243 [2025-01-09 00:13:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:36,627 INFO L471 AbstractCegarLoop]: Abstraction has 28717 states and 32681 transitions. [2025-01-09 00:13:36,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 32681 transitions. [2025-01-09 00:13:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 00:13:36,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:36,630 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:36,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:13:36,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:36,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:36,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1775840158, now seen corresponding path program 1 times [2025-01-09 00:13:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173392533] [2025-01-09 00:13:36,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:36,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 00:13:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 00:13:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:36,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:13:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173392533] [2025-01-09 00:13:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173392533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363250283] [2025-01-09 00:13:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:37,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:37,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:37,016 INFO L87 Difference]: Start difference. First operand 28717 states and 32681 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:38,463 INFO L93 Difference]: Finished difference Result 62951 states and 71863 transitions. [2025-01-09 00:13:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 256 [2025-01-09 00:13:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:38,503 INFO L225 Difference]: With dead ends: 62951 [2025-01-09 00:13:38,503 INFO L226 Difference]: Without dead ends: 33809 [2025-01-09 00:13:38,526 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-09 00:13:38,527 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 378 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:38,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 841 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33809 states. [2025-01-09 00:13:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33809 to 33809. [2025-01-09 00:13:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33809 states, 33808 states have (on average 1.1168066729768102) internal successors, (37757), 33808 states have internal predecessors, (37757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33809 states to 33809 states and 37757 transitions. [2025-01-09 00:13:38,804 INFO L78 Accepts]: Start accepts. Automaton has 33809 states and 37757 transitions. Word has length 256 [2025-01-09 00:13:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:38,804 INFO L471 AbstractCegarLoop]: Abstraction has 33809 states and 37757 transitions. [2025-01-09 00:13:38,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33809 states and 37757 transitions. [2025-01-09 00:13:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 00:13:38,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:38,808 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:13:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:13:38,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1670858766, now seen corresponding path program 1 times [2025-01-09 00:13:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996246508] [2025-01-09 00:13:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:38,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 00:13:38,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 00:13:38,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 78 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996246508] [2025-01-09 00:13:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996246508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411975509] [2025-01-09 00:13:39,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:39,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:39,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:13:39,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 00:13:39,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 00:13:39,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:39,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:39,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:13:39,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 78 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:39,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411975509] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:13:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:13:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554263309] [2025-01-09 00:13:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:39,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:39,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:39,547 INFO L87 Difference]: Start difference. First operand 33809 states and 37757 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:41,685 INFO L93 Difference]: Finished difference Result 83397 states and 93151 transitions. [2025-01-09 00:13:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 314 [2025-01-09 00:13:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:41,741 INFO L225 Difference]: With dead ends: 83397 [2025-01-09 00:13:41,741 INFO L226 Difference]: Without dead ends: 49163 [2025-01-09 00:13:41,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:41,769 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 875 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:41,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 182 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:13:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49163 states. [2025-01-09 00:13:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49163 to 46610. [2025-01-09 00:13:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46610 states, 46609 states have (on average 1.1194619064987448) internal successors, (52177), 46609 states have internal predecessors, (52177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46610 states to 46610 states and 52177 transitions. [2025-01-09 00:13:42,299 INFO L78 Accepts]: Start accepts. Automaton has 46610 states and 52177 transitions. Word has length 314 [2025-01-09 00:13:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 46610 states and 52177 transitions. [2025-01-09 00:13:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46610 states and 52177 transitions. [2025-01-09 00:13:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 00:13:42,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:42,307 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:13:42,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:13:42,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:42,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:42,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1914995639, now seen corresponding path program 1 times [2025-01-09 00:13:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017952041] [2025-01-09 00:13:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:42,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 00:13:42,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 00:13:42,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:42,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:13:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017952041] [2025-01-09 00:13:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017952041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:42,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709300762] [2025-01-09 00:13:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:42,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:42,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:42,686 INFO L87 Difference]: Start difference. First operand 46610 states and 52177 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:44,314 INFO L93 Difference]: Finished difference Result 106835 states and 120197 transitions. [2025-01-09 00:13:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:44,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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-09 00:13:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:44,387 INFO L225 Difference]: With dead ends: 106835 [2025-01-09 00:13:44,388 INFO L226 Difference]: Without dead ends: 58525 [2025-01-09 00:13:44,419 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-09 00:13:44,420 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 338 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:44,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 785 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58525 states. [2025-01-09 00:13:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58525 to 46141. [2025-01-09 00:13:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46141 states, 46140 states have (on average 1.1168183788469874) internal successors, (51530), 46140 states have internal predecessors, (51530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46141 states to 46141 states and 51530 transitions. [2025-01-09 00:13:44,936 INFO L78 Accepts]: Start accepts. Automaton has 46141 states and 51530 transitions. Word has length 414 [2025-01-09 00:13:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 46141 states and 51530 transitions. [2025-01-09 00:13:44,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46141 states and 51530 transitions. [2025-01-09 00:13:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-09 00:13:44,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:44,942 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:44,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:13:44,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1563657583, now seen corresponding path program 1 times [2025-01-09 00:13:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188429396] [2025-01-09 00:13:44,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:44,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 00:13:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 00:13:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-01-09 00:13:45,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188429396] [2025-01-09 00:13:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188429396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005785214] [2025-01-09 00:13:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:45,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:45,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:45,204 INFO L87 Difference]: Start difference. First operand 46141 states and 51530 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:46,584 INFO L93 Difference]: Finished difference Result 105084 states and 117084 transitions. [2025-01-09 00:13:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 415 [2025-01-09 00:13:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:46,661 INFO L225 Difference]: With dead ends: 105084 [2025-01-09 00:13:46,661 INFO L226 Difference]: Without dead ends: 58519 [2025-01-09 00:13:46,696 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-09 00:13:46,697 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 473 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:46,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 346 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:13:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58519 states. [2025-01-09 00:13:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58519 to 46989. [2025-01-09 00:13:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46989 states, 46988 states have (on average 1.1142632161402912) internal successors, (52357), 46988 states have internal predecessors, (52357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46989 states to 46989 states and 52357 transitions. [2025-01-09 00:13:47,204 INFO L78 Accepts]: Start accepts. Automaton has 46989 states and 52357 transitions. Word has length 415 [2025-01-09 00:13:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:47,205 INFO L471 AbstractCegarLoop]: Abstraction has 46989 states and 52357 transitions. [2025-01-09 00:13:47,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 46989 states and 52357 transitions. [2025-01-09 00:13:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 00:13:47,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:47,211 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:47,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:13:47,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:47,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1340714979, now seen corresponding path program 1 times [2025-01-09 00:13:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:47,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135892647] [2025-01-09 00:13:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 00:13:47,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 00:13:47,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:47,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 00:13:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135892647] [2025-01-09 00:13:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135892647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822663496] [2025-01-09 00:13:47,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:47,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:47,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:47,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:47,354 INFO L87 Difference]: Start difference. First operand 46989 states and 52357 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:48,768 INFO L93 Difference]: Finished difference Result 108031 states and 120333 transitions. [2025-01-09 00:13:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 442 [2025-01-09 00:13:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:48,836 INFO L225 Difference]: With dead ends: 108031 [2025-01-09 00:13:48,837 INFO L226 Difference]: Without dead ends: 60618 [2025-01-09 00:13:48,869 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-09 00:13:48,869 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 490 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:48,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 296 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:13:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60618 states. [2025-01-09 00:13:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60618 to 46965. [2025-01-09 00:13:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46965 states, 46964 states have (on average 1.1060173750106463) internal successors, (51943), 46964 states have internal predecessors, (51943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46965 states to 46965 states and 51943 transitions. [2025-01-09 00:13:49,440 INFO L78 Accepts]: Start accepts. Automaton has 46965 states and 51943 transitions. Word has length 442 [2025-01-09 00:13:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:49,440 INFO L471 AbstractCegarLoop]: Abstraction has 46965 states and 51943 transitions. [2025-01-09 00:13:49,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 46965 states and 51943 transitions. [2025-01-09 00:13:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 00:13:49,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:49,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:49,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:13:49,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 724175099, now seen corresponding path program 1 times [2025-01-09 00:13:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:49,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823488694] [2025-01-09 00:13:49,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:49,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 00:13:49,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 00:13:49,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:49,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:13:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823488694] [2025-01-09 00:13:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823488694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146817127] [2025-01-09 00:13:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:49,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:49,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:49,790 INFO L87 Difference]: Start difference. First operand 46965 states and 51943 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:51,302 INFO L93 Difference]: Finished difference Result 107130 states and 118398 transitions. [2025-01-09 00:13:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 454 [2025-01-09 00:13:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:51,363 INFO L225 Difference]: With dead ends: 107130 [2025-01-09 00:13:51,363 INFO L226 Difference]: Without dead ends: 59735 [2025-01-09 00:13:51,387 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-09 00:13:51,388 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 502 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:51,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 166 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59735 states. [2025-01-09 00:13:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59735 to 56738. [2025-01-09 00:13:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56738 states, 56737 states have (on average 1.1049932143045984) internal successors, (62694), 56737 states have internal predecessors, (62694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56738 states to 56738 states and 62694 transitions. [2025-01-09 00:13:51,804 INFO L78 Accepts]: Start accepts. Automaton has 56738 states and 62694 transitions. Word has length 454 [2025-01-09 00:13:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:51,804 INFO L471 AbstractCegarLoop]: Abstraction has 56738 states and 62694 transitions. [2025-01-09 00:13:51,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 56738 states and 62694 transitions. [2025-01-09 00:13:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-01-09 00:13:51,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:51,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:51,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:13:51,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1987224066, now seen corresponding path program 1 times [2025-01-09 00:13:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864692435] [2025-01-09 00:13:51,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:51,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 00:13:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 00:13:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864692435] [2025-01-09 00:13:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864692435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:52,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:13:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809938262] [2025-01-09 00:13:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:52,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:52,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:52,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:52,284 INFO L87 Difference]: Start difference. First operand 56738 states and 62694 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:54,260 INFO L93 Difference]: Finished difference Result 137767 states and 152061 transitions. [2025-01-09 00:13:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 475 [2025-01-09 00:13:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:54,342 INFO L225 Difference]: With dead ends: 137767 [2025-01-09 00:13:54,343 INFO L226 Difference]: Without dead ends: 81031 [2025-01-09 00:13:54,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:13:54,387 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 640 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:54,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 174 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:13:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81031 states. [2025-01-09 00:13:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81031 to 75493. [2025-01-09 00:13:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75493 states, 75492 states have (on average 1.1053489111429025) internal successors, (83445), 75492 states have internal predecessors, (83445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75493 states to 75493 states and 83445 transitions. [2025-01-09 00:13:55,118 INFO L78 Accepts]: Start accepts. Automaton has 75493 states and 83445 transitions. Word has length 475 [2025-01-09 00:13:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:55,118 INFO L471 AbstractCegarLoop]: Abstraction has 75493 states and 83445 transitions. [2025-01-09 00:13:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 75493 states and 83445 transitions. [2025-01-09 00:13:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 00:13:55,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:55,128 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:55,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:13:55,128 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:55,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1338272579, now seen corresponding path program 1 times [2025-01-09 00:13:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718513497] [2025-01-09 00:13:55,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:55,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 00:13:55,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 00:13:55,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:55,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718513497] [2025-01-09 00:13:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718513497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82970383] [2025-01-09 00:13:55,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:55,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:55,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:13:55,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 00:13:56,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 00:13:56,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:56,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:13:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:57,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 263 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:13:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82970383] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:13:58,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:13:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-09 00:13:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235741338] [2025-01-09 00:13:58,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:13:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 00:13:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:58,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 00:13:58,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:13:58,186 INFO L87 Difference]: Start difference. First operand 75493 states and 83445 transitions. Second operand has 8 states, 8 states have (on average 120.75) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:02,882 INFO L93 Difference]: Finished difference Result 176087 states and 194892 transitions. [2025-01-09 00:14:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:14:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 120.75) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 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 518 [2025-01-09 00:14:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:03,019 INFO L225 Difference]: With dead ends: 176087 [2025-01-09 00:14:03,019 INFO L226 Difference]: Without dead ends: 99321 [2025-01-09 00:14:03,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:14:03,082 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2749 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 5274 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2749 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 5274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:03,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2749 Valid, 287 Invalid, 6503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 5274 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:14:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99321 states. [2025-01-09 00:14:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99321 to 93343. [2025-01-09 00:14:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93343 states, 93342 states have (on average 1.1072293287051918) internal successors, (103351), 93342 states have internal predecessors, (103351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93343 states to 93343 states and 103351 transitions. [2025-01-09 00:14:04,149 INFO L78 Accepts]: Start accepts. Automaton has 93343 states and 103351 transitions. Word has length 518 [2025-01-09 00:14:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 93343 states and 103351 transitions. [2025-01-09 00:14:04,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.75) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 93343 states and 103351 transitions. [2025-01-09 00:14:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-09 00:14:04,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:04,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:04,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:14:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:04,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1635030564, now seen corresponding path program 1 times [2025-01-09 00:14:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410804728] [2025-01-09 00:14:04,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:04,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-09 00:14:04,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 00:14:04,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:04,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:14:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410804728] [2025-01-09 00:14:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410804728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:04,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569234223] [2025-01-09 00:14:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:04,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:04,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:04,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:04,554 INFO L87 Difference]: Start difference. First operand 93343 states and 103351 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:06,043 INFO L93 Difference]: Finished difference Result 184548 states and 204340 transitions. [2025-01-09 00:14:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 523 [2025-01-09 00:14:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:06,145 INFO L225 Difference]: With dead ends: 184548 [2025-01-09 00:14:06,145 INFO L226 Difference]: Without dead ends: 91632 [2025-01-09 00:14:06,204 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-09 00:14:06,205 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 479 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:06,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 719 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:14:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91632 states. [2025-01-09 00:14:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91632 to 87803. [2025-01-09 00:14:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87803 states, 87802 states have (on average 1.084701943008132) internal successors, (95239), 87802 states have internal predecessors, (95239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87803 states to 87803 states and 95239 transitions. [2025-01-09 00:14:07,063 INFO L78 Accepts]: Start accepts. Automaton has 87803 states and 95239 transitions. Word has length 523 [2025-01-09 00:14:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:07,063 INFO L471 AbstractCegarLoop]: Abstraction has 87803 states and 95239 transitions. [2025-01-09 00:14:07,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 87803 states and 95239 transitions. [2025-01-09 00:14:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-01-09 00:14:07,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:07,075 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:07,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:14:07,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1813454917, now seen corresponding path program 1 times [2025-01-09 00:14:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833847800] [2025-01-09 00:14:07,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:07,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 00:14:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 00:14:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833847800] [2025-01-09 00:14:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833847800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:07,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:07,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340926759] [2025-01-09 00:14:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:07,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:07,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:07,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:07,607 INFO L87 Difference]: Start difference. First operand 87803 states and 95239 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:09,541 INFO L93 Difference]: Finished difference Result 191374 states and 207749 transitions. [2025-01-09 00:14:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 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 604 [2025-01-09 00:14:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:09,652 INFO L225 Difference]: With dead ends: 191374 [2025-01-09 00:14:09,652 INFO L226 Difference]: Without dead ends: 103998 [2025-01-09 00:14:09,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:14:09,713 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 538 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:09,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 655 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103998 states. [2025-01-09 00:14:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103998 to 100574. [2025-01-09 00:14:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100574 states, 100573 states have (on average 1.08775715152178) internal successors, (109399), 100573 states have internal predecessors, (109399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100574 states to 100574 states and 109399 transitions. [2025-01-09 00:14:10,889 INFO L78 Accepts]: Start accepts. Automaton has 100574 states and 109399 transitions. Word has length 604 [2025-01-09 00:14:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:10,889 INFO L471 AbstractCegarLoop]: Abstraction has 100574 states and 109399 transitions. [2025-01-09 00:14:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 100574 states and 109399 transitions. [2025-01-09 00:14:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-01-09 00:14:10,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:10,903 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:10,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:14:10,903 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 506861255, now seen corresponding path program 1 times [2025-01-09 00:14:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796290505] [2025-01-09 00:14:10,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:10,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 00:14:10,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 00:14:10,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:10,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-09 00:14:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796290505] [2025-01-09 00:14:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796290505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891695425] [2025-01-09 00:14:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:11,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:11,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:11,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:11,120 INFO L87 Difference]: Start difference. First operand 100574 states and 109399 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:12,221 INFO L93 Difference]: Finished difference Result 196875 states and 214021 transitions. [2025-01-09 00:14:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 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 615 [2025-01-09 00:14:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:12,330 INFO L225 Difference]: With dead ends: 196875 [2025-01-09 00:14:12,330 INFO L226 Difference]: Without dead ends: 96728 [2025-01-09 00:14:12,391 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-09 00:14:12,391 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 432 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:12,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 98 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:14:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96728 states. [2025-01-09 00:14:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96728 to 92895. [2025-01-09 00:14:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92895 states, 92894 states have (on average 1.0867763257045664) internal successors, (100955), 92894 states have internal predecessors, (100955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92895 states to 92895 states and 100955 transitions. [2025-01-09 00:14:13,516 INFO L78 Accepts]: Start accepts. Automaton has 92895 states and 100955 transitions. Word has length 615 [2025-01-09 00:14:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 92895 states and 100955 transitions. [2025-01-09 00:14:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 92895 states and 100955 transitions. [2025-01-09 00:14:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-01-09 00:14:13,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:13,530 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:13,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:14:13,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:13,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1145323137, now seen corresponding path program 1 times [2025-01-09 00:14:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066047136] [2025-01-09 00:14:13,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-01-09 00:14:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-01-09 00:14:13,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:14:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066047136] [2025-01-09 00:14:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066047136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25641166] [2025-01-09 00:14:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:14,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:14,055 INFO L87 Difference]: Start difference. First operand 92895 states and 100955 transitions. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:16,376 INFO L93 Difference]: Finished difference Result 207941 states and 225579 transitions. [2025-01-09 00:14:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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 648 [2025-01-09 00:14:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:16,505 INFO L225 Difference]: With dead ends: 207941 [2025-01-09 00:14:16,505 INFO L226 Difference]: Without dead ends: 113344 [2025-01-09 00:14:16,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:14:16,561 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 765 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:16,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 151 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113344 states. [2025-01-09 00:14:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113344 to 104805. [2025-01-09 00:14:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104805 states, 104804 states have (on average 1.087429869088966) internal successors, (113967), 104804 states have internal predecessors, (113967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104805 states to 104805 states and 113967 transitions. [2025-01-09 00:14:17,959 INFO L78 Accepts]: Start accepts. Automaton has 104805 states and 113967 transitions. Word has length 648 [2025-01-09 00:14:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:17,960 INFO L471 AbstractCegarLoop]: Abstraction has 104805 states and 113967 transitions. [2025-01-09 00:14:17,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 104805 states and 113967 transitions. [2025-01-09 00:14:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 00:14:17,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:17,975 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:17,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:14:17,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1326387604, now seen corresponding path program 1 times [2025-01-09 00:14:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172294355] [2025-01-09 00:14:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 00:14:18,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 00:14:18,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:18,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:14:18,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172294355] [2025-01-09 00:14:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172294355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:18,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:18,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717320489] [2025-01-09 00:14:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:18,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:18,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:18,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:18,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:18,685 INFO L87 Difference]: Start difference. First operand 104805 states and 113967 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:20,708 INFO L93 Difference]: Finished difference Result 215585 states and 234298 transitions. [2025-01-09 00:14:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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 667 [2025-01-09 00:14:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:20,832 INFO L225 Difference]: With dead ends: 215585 [2025-01-09 00:14:20,832 INFO L226 Difference]: Without dead ends: 110779 [2025-01-09 00:14:20,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:14:20,879 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1228 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:20,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 642 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110779 states. [2025-01-09 00:14:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110779 to 105222. [2025-01-09 00:14:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105222 states, 105221 states have (on average 1.085420210794423) internal successors, (114209), 105221 states have internal predecessors, (114209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105222 states to 105222 states and 114209 transitions. [2025-01-09 00:14:22,166 INFO L78 Accepts]: Start accepts. Automaton has 105222 states and 114209 transitions. Word has length 667 [2025-01-09 00:14:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:22,167 INFO L471 AbstractCegarLoop]: Abstraction has 105222 states and 114209 transitions. [2025-01-09 00:14:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 105222 states and 114209 transitions. [2025-01-09 00:14:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 00:14:22,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:22,189 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:14:22,189 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -62582787, now seen corresponding path program 1 times [2025-01-09 00:14:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443701437] [2025-01-09 00:14:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 00:14:22,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 00:14:22,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:22,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 00:14:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443701437] [2025-01-09 00:14:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443701437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455619923] [2025-01-09 00:14:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:22,691 INFO L87 Difference]: Start difference. First operand 105222 states and 114209 transitions. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:24,338 INFO L93 Difference]: Finished difference Result 221089 states and 239738 transitions. [2025-01-09 00:14:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 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 673 [2025-01-09 00:14:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:24,485 INFO L225 Difference]: With dead ends: 221089 [2025-01-09 00:14:24,485 INFO L226 Difference]: Without dead ends: 112452 [2025-01-09 00:14:24,554 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-09 00:14:24,554 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 307 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:24,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 634 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112452 states. [2025-01-09 00:14:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112452 to 105637. [2025-01-09 00:14:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105637 states, 105636 states have (on average 1.0763660115869589) internal successors, (113703), 105636 states have internal predecessors, (113703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105637 states to 105637 states and 113703 transitions. [2025-01-09 00:14:25,870 INFO L78 Accepts]: Start accepts. Automaton has 105637 states and 113703 transitions. Word has length 673 [2025-01-09 00:14:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:25,870 INFO L471 AbstractCegarLoop]: Abstraction has 105637 states and 113703 transitions. [2025-01-09 00:14:25,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 105637 states and 113703 transitions. [2025-01-09 00:14:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-01-09 00:14:25,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:25,886 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:14:25,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1981334184, now seen corresponding path program 1 times [2025-01-09 00:14:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492821158] [2025-01-09 00:14:25,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:25,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-01-09 00:14:25,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-01-09 00:14:25,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:25,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-01-09 00:14:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492821158] [2025-01-09 00:14:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492821158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434498709] [2025-01-09 00:14:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:26,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:26,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:26,428 INFO L87 Difference]: Start difference. First operand 105637 states and 113703 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:28,080 INFO L93 Difference]: Finished difference Result 221056 states and 237918 transitions. [2025-01-09 00:14:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 677 [2025-01-09 00:14:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:28,213 INFO L225 Difference]: With dead ends: 221056 [2025-01-09 00:14:28,213 INFO L226 Difference]: Without dead ends: 115846 [2025-01-09 00:14:28,263 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-09 00:14:28,264 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 389 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:28,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 309 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:14:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115846 states. [2025-01-09 00:14:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115846 to 111162. [2025-01-09 00:14:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111162 states, 111161 states have (on average 1.0725524239616413) internal successors, (119226), 111161 states have internal predecessors, (119226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111162 states to 111162 states and 119226 transitions. [2025-01-09 00:14:29,335 INFO L78 Accepts]: Start accepts. Automaton has 111162 states and 119226 transitions. Word has length 677 [2025-01-09 00:14:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:29,335 INFO L471 AbstractCegarLoop]: Abstraction has 111162 states and 119226 transitions. [2025-01-09 00:14:29,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 111162 states and 119226 transitions. [2025-01-09 00:14:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-01-09 00:14:29,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:29,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:29,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:14:29,351 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:29,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:29,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1880610093, now seen corresponding path program 1 times [2025-01-09 00:14:29,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:29,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341897461] [2025-01-09 00:14:29,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-01-09 00:14:29,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-01-09 00:14:29,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:29,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 00:14:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341897461] [2025-01-09 00:14:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341897461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768682178] [2025-01-09 00:14:29,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:29,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:29,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:29,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:29,841 INFO L87 Difference]: Start difference. First operand 111162 states and 119226 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:31,464 INFO L93 Difference]: Finished difference Result 231264 states and 248107 transitions. [2025-01-09 00:14:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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 696 [2025-01-09 00:14:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:31,620 INFO L225 Difference]: With dead ends: 231264 [2025-01-09 00:14:31,620 INFO L226 Difference]: Without dead ends: 120529 [2025-01-09 00:14:31,700 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-09 00:14:31,700 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 264 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:14:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120529 states. [2025-01-09 00:14:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120529 to 118821. [2025-01-09 00:14:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118821 states, 118820 states have (on average 1.0684564888065982) internal successors, (126954), 118820 states have internal predecessors, (126954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118821 states to 118821 states and 126954 transitions. [2025-01-09 00:14:33,032 INFO L78 Accepts]: Start accepts. Automaton has 118821 states and 126954 transitions. Word has length 696 [2025-01-09 00:14:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:33,033 INFO L471 AbstractCegarLoop]: Abstraction has 118821 states and 126954 transitions. [2025-01-09 00:14:33,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 118821 states and 126954 transitions. [2025-01-09 00:14:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-01-09 00:14:33,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:33,221 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:14:33,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1534562767, now seen corresponding path program 1 times [2025-01-09 00:14:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629263561] [2025-01-09 00:14:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:33,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-01-09 00:14:33,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-01-09 00:14:33,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:33,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:14:33,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:14:33,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-01-09 00:14:33,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-01-09 00:14:33,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:33,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:14:33,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:14:33,512 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:14:33,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:14:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:14:33,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:33,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:14:33,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:14:33 BoogieIcfgContainer [2025-01-09 00:14:33,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:14:33,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:14:33,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:14:33,675 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:14:33,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:16" (3/4) ... [2025-01-09 00:14:33,676 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample