./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 48aec8d1d241a0a7736380f3571da3a89472d426f8d78df6e318e9a8d52f121e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:40:12,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:40:13,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:40:13,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:40:13,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:40:13,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:40:13,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:40:13,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:40:13,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:40:13,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:40:13,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:40:13,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:40:13,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:40:13,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:40:13,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:40:13,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:40:13,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:40:13,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:40:13,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:40:13,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:40:13,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:13,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:40:13,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:40:13,022 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/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 -> 48aec8d1d241a0a7736380f3571da3a89472d426f8d78df6e318e9a8d52f121e [2025-03-03 10:40:13,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:40:13,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:40:13,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:40:13,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:40:13,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:40:13,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label02.c [2025-03-03 10:40:14,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4210ab2d7/1bd5d206250a4f51a06f3936f7323228/FLAGdc8bc1475 [2025-03-03 10:40:14,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:40:14,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label02.c [2025-03-03 10:40:14,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4210ab2d7/1bd5d206250a4f51a06f3936f7323228/FLAGdc8bc1475 [2025-03-03 10:40:14,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4210ab2d7/1bd5d206250a4f51a06f3936f7323228 [2025-03-03 10:40:14,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:40:14,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:40:14,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:14,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:40:14,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:40:14,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:14" (1/1) ... [2025-03-03 10:40:14,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:14, skipping insertion in model container [2025-03-03 10:40:14,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:40:14" (1/1) ... [2025-03-03 10:40:15,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:40:15,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label02.c[5671,5684] [2025-03-03 10:40:15,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:15,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:40:15,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label02.c[5671,5684] [2025-03-03 10:40:16,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:40:16,167 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:40:16,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16 WrapperNode [2025-03-03 10:40:16,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:40:16,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:16,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:40:16,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:40:16,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,543 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:40:16,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:40:16,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:40:16,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:40:16,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:40:16,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,829 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-03-03 10:40:16,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:16,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:17,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:17,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:17,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:17,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:40:17,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:40:17,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:40:17,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:40:17,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (1/1) ... [2025-03-03 10:40:17,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:40:17,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:17,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:40:17,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:40:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:40:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:40:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:40:17,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:40:17,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:40:17,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:40:21,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:40:21,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:40:21,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:40:21,145 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:40:21,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:40:21,165 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:40:21,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:40:21,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:21 BoogieIcfgContainer [2025-03-03 10:40:21,166 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:40:21,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:40:21,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:40:21,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:40:21,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:40:14" (1/3) ... [2025-03-03 10:40:21,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29998e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:21, skipping insertion in model container [2025-03-03 10:40:21,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:40:16" (2/3) ... [2025-03-03 10:40:21,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29998e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:40:21, skipping insertion in model container [2025-03-03 10:40:21,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:40:21" (3/3) ... [2025-03-03 10:40:21,172 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label02.c [2025-03-03 10:40:21,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:40:21,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label02.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:40:21,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:40:21,264 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;@7dea3e2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:40:21,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:40:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 10:40:21,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:21,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:21,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:21,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1705667737, now seen corresponding path program 1 times [2025-03-03 10:40:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576992214] [2025-03-03 10:40:21,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:21,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 10:40:21,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 10:40:21,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:21,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:21,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576992214] [2025-03-03 10:40:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576992214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400438351] [2025-03-03 10:40:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:21,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:21,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:21,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:21,604 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:25,108 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-03-03 10:40:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 10:40:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:25,129 INFO L225 Difference]: With dead ends: 3121 [2025-03-03 10:40:25,129 INFO L226 Difference]: Without dead ends: 1944 [2025-03-03 10:40:25,137 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-03-03 10:40:25,139 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 950 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:25,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 571 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:40:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-03-03 10:40:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-03-03 10:40:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-03-03 10:40:25,226 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 39 [2025-03-03 10:40:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-03-03 10:40:25,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-03-03 10:40:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 10:40:25,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:25,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:25,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:40:25,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1725398497, now seen corresponding path program 1 times [2025-03-03 10:40:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798647657] [2025-03-03 10:40:25,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:25,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 10:40:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 10:40:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798647657] [2025-03-03 10:40:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798647657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:25,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874425604] [2025-03-03 10:40:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:25,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:25,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:25,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:25,574 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-03-03 10:40:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:28,249 INFO L93 Difference]: Finished difference Result 4604 states and 7964 transitions. [2025-03-03 10:40:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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 104 [2025-03-03 10:40:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:28,258 INFO L225 Difference]: With dead ends: 4604 [2025-03-03 10:40:28,259 INFO L226 Difference]: Without dead ends: 2733 [2025-03-03 10:40:28,261 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-03-03 10:40:28,261 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:28,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 738 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:40:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-03 10:40:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2670. [2025-03-03 10:40:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 1.6579243162233046) internal successors, (4425), 2669 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4425 transitions. [2025-03-03 10:40:28,302 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4425 transitions. Word has length 104 [2025-03-03 10:40:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:28,302 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4425 transitions. [2025-03-03 10:40:28,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-03-03 10:40:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4425 transitions. [2025-03-03 10:40:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 10:40:28,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:28,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:28,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:40:28,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:28,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1164955855, now seen corresponding path program 1 times [2025-03-03 10:40:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065310713] [2025-03-03 10:40:28,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:28,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 10:40:28,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 10:40:28,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:28,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065310713] [2025-03-03 10:40:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065310713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745759031] [2025-03-03 10:40:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:28,443 INFO L87 Difference]: Start difference. First operand 2670 states and 4425 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-03-03 10:40:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:30,970 INFO L93 Difference]: Finished difference Result 7732 states and 12864 transitions. [2025-03-03 10:40:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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 105 [2025-03-03 10:40:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:30,984 INFO L225 Difference]: With dead ends: 7732 [2025-03-03 10:40:30,984 INFO L226 Difference]: Without dead ends: 5064 [2025-03-03 10:40:30,986 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-03-03 10:40:30,986 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 870 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:30,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1136 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:40:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-03 10:40:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5063. [2025-03-03 10:40:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-03-03 10:40:31,047 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 105 [2025-03-03 10:40:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:31,048 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-03-03 10:40:31,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-03-03 10:40:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-03-03 10:40:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 10:40:31,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:31,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:31,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:40:31,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1579082325, now seen corresponding path program 1 times [2025-03-03 10:40:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598632311] [2025-03-03 10:40:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:31,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 10:40:31,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 10:40:31,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598632311] [2025-03-03 10:40:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598632311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:31,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:31,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272652343] [2025-03-03 10:40:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:31,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:31,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:31,148 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:33,891 INFO L93 Difference]: Finished difference Result 12513 states and 18431 transitions. [2025-03-03 10:40:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 10:40:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:33,906 INFO L225 Difference]: With dead ends: 12513 [2025-03-03 10:40:33,907 INFO L226 Difference]: Without dead ends: 7452 [2025-03-03 10:40:33,910 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-03-03 10:40:33,910 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 871 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:33,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1175 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:40:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2025-03-03 10:40:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7444. [2025-03-03 10:40:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7444 states, 7443 states have (on average 1.336826548434771) internal successors, (9950), 7443 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 9950 transitions. [2025-03-03 10:40:33,998 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 9950 transitions. Word has length 108 [2025-03-03 10:40:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 7444 states and 9950 transitions. [2025-03-03 10:40:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 9950 transitions. [2025-03-03 10:40:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 10:40:34,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:34,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:40:34,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:34,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2033262569, now seen corresponding path program 1 times [2025-03-03 10:40:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511176124] [2025-03-03 10:40:34,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:34,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 10:40:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 10:40:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:34,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:34,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511176124] [2025-03-03 10:40:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511176124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211214354] [2025-03-03 10:40:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:34,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:34,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:34,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:34,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:34,092 INFO L87 Difference]: Start difference. First operand 7444 states and 9950 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:36,535 INFO L93 Difference]: Finished difference Result 20424 states and 27781 transitions. [2025-03-03 10:40:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 10:40:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:36,565 INFO L225 Difference]: With dead ends: 20424 [2025-03-03 10:40:36,565 INFO L226 Difference]: Without dead ends: 13769 [2025-03-03 10:40:36,574 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-03-03 10:40:36,574 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 806 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:36,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1160 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:40:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2025-03-03 10:40:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13751. [2025-03-03 10:40:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13751 states, 13750 states have (on average 1.2261090909090908) internal successors, (16859), 13750 states have internal predecessors, (16859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13751 states to 13751 states and 16859 transitions. [2025-03-03 10:40:36,844 INFO L78 Accepts]: Start accepts. Automaton has 13751 states and 16859 transitions. Word has length 112 [2025-03-03 10:40:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 13751 states and 16859 transitions. [2025-03-03 10:40:36,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13751 states and 16859 transitions. [2025-03-03 10:40:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 10:40:36,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:36,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:36,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:40:36,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 802176579, now seen corresponding path program 1 times [2025-03-03 10:40:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308560601] [2025-03-03 10:40:36,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:36,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 10:40:36,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 10:40:36,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:36,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308560601] [2025-03-03 10:40:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308560601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318020638] [2025-03-03 10:40:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:36,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:36,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:36,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:36,970 INFO L87 Difference]: Start difference. First operand 13751 states and 16859 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:39,965 INFO L93 Difference]: Finished difference Result 33022 states and 41589 transitions. [2025-03-03 10:40:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:39,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-03 10:40:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:39,998 INFO L225 Difference]: With dead ends: 33022 [2025-03-03 10:40:39,998 INFO L226 Difference]: Without dead ends: 20060 [2025-03-03 10:40:40,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:40,012 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 958 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:40,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1671 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:40:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-03-03 10:40:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-03-03 10:40:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2318320115716495) internal successors, (24697), 20049 states have internal predecessors, (24697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24697 transitions. [2025-03-03 10:40:40,264 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24697 transitions. Word has length 128 [2025-03-03 10:40:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:40,264 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24697 transitions. [2025-03-03 10:40:40,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24697 transitions. [2025-03-03 10:40:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 10:40:40,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:40,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:40:40,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:40:40,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:40,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 569666213, now seen corresponding path program 1 times [2025-03-03 10:40:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612372143] [2025-03-03 10:40:40,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 10:40:40,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 10:40:40,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:40,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612372143] [2025-03-03 10:40:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612372143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700889974] [2025-03-03 10:40:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:40,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:40,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:40,345 INFO L87 Difference]: Start difference. First operand 20050 states and 24697 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:43,928 INFO L93 Difference]: Finished difference Result 39329 states and 48628 transitions. [2025-03-03 10:40:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:43,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-03 10:40:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:43,959 INFO L225 Difference]: With dead ends: 39329 [2025-03-03 10:40:43,959 INFO L226 Difference]: Without dead ends: 20068 [2025-03-03 10:40:43,975 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-03-03 10:40:43,976 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1085 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:43,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1373 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 10:40:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20068 states. [2025-03-03 10:40:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20068 to 20050. [2025-03-03 10:40:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2169185495535937) internal successors, (24398), 20049 states have internal predecessors, (24398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24398 transitions. [2025-03-03 10:40:44,246 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24398 transitions. Word has length 135 [2025-03-03 10:40:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:44,246 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24398 transitions. [2025-03-03 10:40:44,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24398 transitions. [2025-03-03 10:40:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 10:40:44,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:44,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:44,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:40:44,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:44,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1267781865, now seen corresponding path program 1 times [2025-03-03 10:40:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:44,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359510678] [2025-03-03 10:40:44,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 10:40:44,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 10:40:44,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:44,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 10:40:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359510678] [2025-03-03 10:40:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359510678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:40:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46776237] [2025-03-03 10:40:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:44,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:44,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:44,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:44,504 INFO L87 Difference]: Start difference. First operand 20050 states and 24398 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:46,667 INFO L93 Difference]: Finished difference Result 39311 states and 47997 transitions. [2025-03-03 10:40:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-03 10:40:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:46,692 INFO L225 Difference]: With dead ends: 39311 [2025-03-03 10:40:46,692 INFO L226 Difference]: Without dead ends: 20050 [2025-03-03 10:40:46,710 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-03-03 10:40:46,711 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:46,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:40:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2025-03-03 10:40:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2025-03-03 10:40:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2025-03-03 10:40:46,991 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 210 [2025-03-03 10:40:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2025-03-03 10:40:46,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2025-03-03 10:40:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 10:40:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:46,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:40:46,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1014277941, now seen corresponding path program 1 times [2025-03-03 10:40:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256764860] [2025-03-03 10:40:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 10:40:47,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 10:40:47,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:47,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:40:47,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:47,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256764860] [2025-03-03 10:40:47,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256764860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:47,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:47,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507325775] [2025-03-03 10:40:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:47,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:47,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:47,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:47,107 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:49,477 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2025-03-03 10:40:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-03 10:40:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:49,558 INFO L225 Difference]: With dead ends: 39321 [2025-03-03 10:40:49,558 INFO L226 Difference]: Without dead ends: 20060 [2025-03-03 10:40:49,563 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-03-03 10:40:49,563 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:49,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 928 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:40:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-03-03 10:40:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-03-03 10:40:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2025-03-03 10:40:49,780 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 217 [2025-03-03 10:40:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:49,780 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2025-03-03 10:40:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2025-03-03 10:40:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 10:40:49,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:49,785 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:40:49,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -861027491, now seen corresponding path program 1 times [2025-03-03 10:40:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866961114] [2025-03-03 10:40:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:49,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 10:40:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 10:40:49,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:49,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-03 10:40:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866961114] [2025-03-03 10:40:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866961114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887650678] [2025-03-03 10:40:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:49,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:49,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:49,969 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:52,646 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2025-03-03 10:40:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2025-03-03 10:40:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:52,671 INFO L225 Difference]: With dead ends: 45630 [2025-03-03 10:40:52,671 INFO L226 Difference]: Without dead ends: 26369 [2025-03-03 10:40:52,685 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-03-03 10:40:52,686 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:52,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 787 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:40:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2025-03-03 10:40:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2025-03-03 10:40:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2025-03-03 10:40:52,937 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 306 [2025-03-03 10:40:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:52,938 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2025-03-03 10:40:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2025-03-03 10:40:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-03 10:40:52,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:52,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:40:52,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:40:52,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -774111628, now seen corresponding path program 1 times [2025-03-03 10:40:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053534064] [2025-03-03 10:40:52,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:52,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-03 10:40:52,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-03 10:40:52,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:52,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 10:40:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053534064] [2025-03-03 10:40:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053534064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486976425] [2025-03-03 10:40:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:53,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:53,203 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:55,585 INFO L93 Difference]: Finished difference Result 51951 states and 59618 transitions. [2025-03-03 10:40:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:55,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 358 [2025-03-03 10:40:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:55,611 INFO L225 Difference]: With dead ends: 51951 [2025-03-03 10:40:55,611 INFO L226 Difference]: Without dead ends: 26383 [2025-03-03 10:40:55,627 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-03-03 10:40:55,628 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 780 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:55,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1916 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:40:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26383 states. [2025-03-03 10:40:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26383 to 26357. [2025-03-03 10:40:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.140992563363181) internal successors, (30072), 26356 states have internal predecessors, (30072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30072 transitions. [2025-03-03 10:40:55,868 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30072 transitions. Word has length 358 [2025-03-03 10:40:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:55,869 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30072 transitions. [2025-03-03 10:40:55,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30072 transitions. [2025-03-03 10:40:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 10:40:55,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:55,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:55,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:40:55,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:55,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1016201877, now seen corresponding path program 1 times [2025-03-03 10:40:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567852621] [2025-03-03 10:40:55,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:55,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 10:40:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 10:40:55,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:55,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:40:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567852621] [2025-03-03 10:40:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567852621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:40:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:40:56,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:40:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111027307] [2025-03-03 10:40:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:40:56,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:40:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:40:56,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:40:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:40:56,097 INFO L87 Difference]: Start difference. First operand 26357 states and 30072 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-03-03 10:40:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:40:59,208 INFO L93 Difference]: Finished difference Result 64642 states and 74179 transitions. [2025-03-03 10:40:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:40:59,208 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 366 [2025-03-03 10:40:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:40:59,245 INFO L225 Difference]: With dead ends: 64642 [2025-03-03 10:40:59,245 INFO L226 Difference]: Without dead ends: 39074 [2025-03-03 10:40:59,257 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-03-03 10:40:59,257 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 991 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:40:59,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 489 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:40:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39074 states. [2025-03-03 10:40:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39074 to 38207. [2025-03-03 10:40:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38207 states, 38206 states have (on average 1.148091922734649) internal successors, (43864), 38206 states have internal predecessors, (43864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:40:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 43864 transitions. [2025-03-03 10:40:59,523 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 43864 transitions. Word has length 366 [2025-03-03 10:40:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:40:59,524 INFO L471 AbstractCegarLoop]: Abstraction has 38207 states and 43864 transitions. [2025-03-03 10:40:59,524 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-03-03 10:40:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 43864 transitions. [2025-03-03 10:40:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-03 10:40:59,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:40:59,527 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:40:59,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:40:59,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:40:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:40:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1700971915, now seen corresponding path program 1 times [2025-03-03 10:40:59,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:40:59,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007108328] [2025-03-03 10:40:59,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:40:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 10:40:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 10:40:59,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:40:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:40:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 147 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 10:40:59,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:40:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007108328] [2025-03-03 10:40:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007108328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:40:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882356121] [2025-03-03 10:40:59,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:40:59,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:40:59,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:40:59,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:40:59,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:40:59,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-03 10:41:00,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-03 10:41:00,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:00,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:41:00,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:41:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-03 10:41:00,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:41:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882356121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:41:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:41:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767714875] [2025-03-03 10:41:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:00,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:41:00,379 INFO L87 Difference]: Start difference. First operand 38207 states and 43864 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:03,064 INFO L93 Difference]: Finished difference Result 112785 states and 129684 transitions. [2025-03-03 10:41:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2025-03-03 10:41:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:03,143 INFO L225 Difference]: With dead ends: 112785 [2025-03-03 10:41:03,143 INFO L226 Difference]: Without dead ends: 75367 [2025-03-03 10:41:03,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:41:03,176 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 1042 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:03,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1207 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:41:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75367 states. [2025-03-03 10:41:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75367 to 75346. [2025-03-03 10:41:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75346 states, 75345 states have (on average 1.119039086867078) internal successors, (84314), 75345 states have internal predecessors, (84314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75346 states to 75346 states and 84314 transitions. [2025-03-03 10:41:03,806 INFO L78 Accepts]: Start accepts. Automaton has 75346 states and 84314 transitions. Word has length 366 [2025-03-03 10:41:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 75346 states and 84314 transitions. [2025-03-03 10:41:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 75346 states and 84314 transitions. [2025-03-03 10:41:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-03 10:41:03,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:03,812 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:03,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:41:04,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 10:41:04,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 280267339, now seen corresponding path program 1 times [2025-03-03 10:41:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22743163] [2025-03-03 10:41:04,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:04,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-03 10:41:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-03 10:41:04,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:04,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-03 10:41:04,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22743163] [2025-03-03 10:41:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22743163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:04,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:04,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312837289] [2025-03-03 10:41:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:04,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:41:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:04,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:41:04,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:41:04,179 INFO L87 Difference]: Start difference. First operand 75346 states and 84314 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:09,295 INFO L93 Difference]: Finished difference Result 218672 states and 245580 transitions. [2025-03-03 10:41:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:41:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2025-03-03 10:41:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:09,452 INFO L225 Difference]: With dead ends: 218672 [2025-03-03 10:41:09,452 INFO L226 Difference]: Without dead ends: 144115 [2025-03-03 10:41:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:41:09,504 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1748 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6108 mSolverCounterSat, 1145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1145 IncrementalHoareTripleChecker+Valid, 6108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:09,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 789 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1145 Valid, 6108 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 10:41:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144115 states. [2025-03-03 10:41:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144115 to 143925. [2025-03-03 10:41:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143925 states, 143924 states have (on average 1.1133236986187154) internal successors, (160234), 143924 states have internal predecessors, (160234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143925 states to 143925 states and 160234 transitions. [2025-03-03 10:41:11,108 INFO L78 Accepts]: Start accepts. Automaton has 143925 states and 160234 transitions. Word has length 401 [2025-03-03 10:41:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:11,109 INFO L471 AbstractCegarLoop]: Abstraction has 143925 states and 160234 transitions. [2025-03-03 10:41:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 143925 states and 160234 transitions. [2025-03-03 10:41:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-03 10:41:11,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:11,117 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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-03-03 10:41:11,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:41:11,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:11,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1192840584, now seen corresponding path program 1 times [2025-03-03 10:41:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11676435] [2025-03-03 10:41:11,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 10:41:11,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 10:41:11,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:11,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 377 proven. 113 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-03 10:41:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11676435] [2025-03-03 10:41:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11676435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:41:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198869720] [2025-03-03 10:41:12,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:41:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:41:12,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:41:12,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:41:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 10:41:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 10:41:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:12,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:41:12,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:41:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 10:41:13,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:41:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198869720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:41:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-03 10:41:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508204205] [2025-03-03 10:41:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:13,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:13,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:13,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:41:13,218 INFO L87 Difference]: Start difference. First operand 143925 states and 160234 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:15,738 INFO L93 Difference]: Finished difference Result 292596 states and 325528 transitions. [2025-03-03 10:41:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2025-03-03 10:41:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:16,156 INFO L225 Difference]: With dead ends: 292596 [2025-03-03 10:41:16,156 INFO L226 Difference]: Without dead ends: 149460 [2025-03-03 10:41:16,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:41:16,207 INFO L435 NwaCegarLoop]: 1075 mSDtfsCounter, 685 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:16,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1211 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:41:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149460 states. [2025-03-03 10:41:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149460 to 149442. [2025-03-03 10:41:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149442 states, 149441 states have (on average 1.1105252240014454) internal successors, (165958), 149441 states have internal predecessors, (165958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149442 states to 149442 states and 165958 transitions. [2025-03-03 10:41:17,644 INFO L78 Accepts]: Start accepts. Automaton has 149442 states and 165958 transitions. Word has length 433 [2025-03-03 10:41:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 149442 states and 165958 transitions. [2025-03-03 10:41:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 149442 states and 165958 transitions. [2025-03-03 10:41:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-03 10:41:17,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:17,653 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:41:17,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:41:17,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:41:17,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:17,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 467030553, now seen corresponding path program 1 times [2025-03-03 10:41:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990964836] [2025-03-03 10:41:17,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:17,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:17,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-03 10:41:17,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-03 10:41:17,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:41:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990964836] [2025-03-03 10:41:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990964836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:18,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:18,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912997410] [2025-03-03 10:41:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:18,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:18,480 INFO L87 Difference]: Start difference. First operand 149442 states and 165958 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:21,815 INFO L93 Difference]: Finished difference Result 310626 states and 346277 transitions. [2025-03-03 10:41:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2025-03-03 10:41:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:22,019 INFO L225 Difference]: With dead ends: 310626 [2025-03-03 10:41:22,019 INFO L226 Difference]: Without dead ends: 161973 [2025-03-03 10:41:22,092 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-03-03 10:41:22,093 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 1053 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:22,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1541 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:41:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161973 states. [2025-03-03 10:41:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161973 to 157233. [2025-03-03 10:41:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157233 states, 157232 states have (on average 1.0860003052813676) internal successors, (170754), 157232 states have internal predecessors, (170754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157233 states to 157233 states and 170754 transitions. [2025-03-03 10:41:23,618 INFO L78 Accepts]: Start accepts. Automaton has 157233 states and 170754 transitions. Word has length 462 [2025-03-03 10:41:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 157233 states and 170754 transitions. [2025-03-03 10:41:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 157233 states and 170754 transitions. [2025-03-03 10:41:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-03 10:41:23,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:23,625 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:41:23,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1019323658, now seen corresponding path program 1 times [2025-03-03 10:41:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331195603] [2025-03-03 10:41:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:23,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-03 10:41:23,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-03 10:41:23,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-03 10:41:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331195603] [2025-03-03 10:41:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331195603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299838409] [2025-03-03 10:41:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:24,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:24,038 INFO L87 Difference]: Start difference. First operand 157233 states and 170754 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:27,431 INFO L93 Difference]: Finished difference Result 370341 states and 403741 transitions. [2025-03-03 10:41:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 483 [2025-03-03 10:41:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:27,733 INFO L225 Difference]: With dead ends: 370341 [2025-03-03 10:41:27,734 INFO L226 Difference]: Without dead ends: 213897 [2025-03-03 10:41:27,838 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-03-03 10:41:27,838 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 844 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:27,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1744 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:41:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213897 states. [2025-03-03 10:41:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213897 to 212321. [2025-03-03 10:41:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212321 states, 212320 states have (on average 1.0818481537302185) internal successors, (229698), 212320 states have internal predecessors, (229698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212321 states to 212321 states and 229698 transitions. [2025-03-03 10:41:30,100 INFO L78 Accepts]: Start accepts. Automaton has 212321 states and 229698 transitions. Word has length 483 [2025-03-03 10:41:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 212321 states and 229698 transitions. [2025-03-03 10:41:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 212321 states and 229698 transitions. [2025-03-03 10:41:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 10:41:30,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:30,108 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:41:30,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1735651317, now seen corresponding path program 1 times [2025-03-03 10:41:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274627771] [2025-03-03 10:41:30,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:30,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 10:41:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 10:41:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 772 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-03 10:41:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:30,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274627771] [2025-03-03 10:41:30,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274627771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:30,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027180990] [2025-03-03 10:41:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:30,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:30,587 INFO L87 Difference]: Start difference. First operand 212321 states and 229698 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:33,837 INFO L93 Difference]: Finished difference Result 423878 states and 458643 transitions. [2025-03-03 10:41:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:33,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 500 [2025-03-03 10:41:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:34,118 INFO L225 Difference]: With dead ends: 423878 [2025-03-03 10:41:34,118 INFO L226 Difference]: Without dead ends: 212346 [2025-03-03 10:41:34,218 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-03-03 10:41:34,219 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 781 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1810 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:41:34,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212346 states. [2025-03-03 10:41:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212346 to 212321. [2025-03-03 10:41:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212321 states, 212320 states have (on average 1.0774679728711378) internal successors, (228768), 212320 states have internal predecessors, (228768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212321 states to 212321 states and 228768 transitions. [2025-03-03 10:41:36,991 INFO L78 Accepts]: Start accepts. Automaton has 212321 states and 228768 transitions. Word has length 500 [2025-03-03 10:41:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:36,991 INFO L471 AbstractCegarLoop]: Abstraction has 212321 states and 228768 transitions. [2025-03-03 10:41:36,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 212321 states and 228768 transitions. [2025-03-03 10:41:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-03 10:41:37,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:37,001 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:41:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:41:37,001 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 108243303, now seen corresponding path program 1 times [2025-03-03 10:41:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998170879] [2025-03-03 10:41:37,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:37,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 10:41:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 10:41:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-03 10:41:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998170879] [2025-03-03 10:41:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998170879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:37,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:41:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565819974] [2025-03-03 10:41:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:37,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:37,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:37,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:37,127 INFO L87 Difference]: Start difference. First operand 212321 states and 228768 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)